Hybrid Bypass Simulation

Hybrid Bypass Routing and Wavelength Assignment algorithm for traffic requests on 2 queues , having the requested capacities randomised by following a Uniform distribution process.

Implementation by Konstantinos Delistavrou © 2021-2025


Simulator output details
stdoutOriginal: <_io.TextIOWrapper name='' mode='w' encoding='utf-8'>
sys.stdout: <_io.TextIOWrapper name='/home/kostas/simnewdetails/Alg_HybridBypass_Net-Shen_Tucker_b_N14L21_X-40_y2025_m5_d4_h20_m29_s8_u502987/Alg_HybridBypass_Net-Shen_Tucker_b_N14L21_X-40.html' mode='a' encoding='utf-8'>
graphsPath: /home/kostas/simnewdetails/Alg_HybridBypass_Net-Shen_Tucker_b_N14L21_X-40_y2025_m5_d4_h20_m29_s8_u502987
Maximum fiber capacity
Each wavelength capacity is 40.0 Gbps
Each fiber can multiplex up to 16 wavelengths
Therefore, the maximum fiber capacity can reach 640.0 Gbps
Maximum link capacity
Each link can include up to ∞ fibers
Therefore, the maximum link capacity can reach ∞ Gbps
The links are bidirectional. Therefore, each fiber can transfer information in both directions.
N: Set of nodes
Node 0 is Node0
Node 1 is Node1
Node 2 is Node2
Node 3 is Node3
Node 4 is Node4
Node 5 is Node5
Node 6 is Node6
Node 7 is Node7
Node 8 is Node8
Node 9 is Node9
Node 10 is Node10
Node 11 is Node11
Node 12 is Node12
Node 13 is Node13
Nm: Set of neighbouring nodes
Node 0 neighbours [1, 3, 2]
Node 1 neighbours [0, 2, 7]
Node 2 neighbours [0, 1, 5]
Node 3 neighbours [0, 4, 10]
Node 4 neighbours [3, 5, 6]
Node 5 neighbours [2, 4, 9, 12]
Node 6 neighbours [4, 7]
Node 7 neighbours [6, 1, 8]
Node 8 neighbours [7, 11, 13, 9]
Node 9 neighbours [5, 8]
Node 10 neighbours [3, 11, 13]
Node 11 neighbours [8, 10, 12]
Node 12 neighbours [5, 11, 13]
Node 13 neighbours [12, 8, 10]
L: Set of bidirectional Links
[[0, 1], [0, 2], [1, 2], [0, 3], [1, 7], [2, 5], [3, 4], [4, 5], [4, 6], [6, 7], [7, 8], [3, 10], [5, 9], [5, 12], [8, 9], [8, 11], [8, 13], [10, 11], [11, 12], [10, 13], [12, 13]]
G: The physical topology
(['Node0', 'Node1', 'Node2', 'Node3', 'Node4', 'Node5', 'Node6', 'Node7', 'Node8', 'Node9', 'Node10', 'Node11', 'Node12', 'Node13'], [[0, 1], [0, 2], [1, 2], [0, 3], [1, 7], [2, 5], [3, 4], [4, 5], [4, 6], [6, 7], [7, 8], [3, 10], [5, 9], [5, 12], [8, 9], [8, 11], [8, 13], [10, 11], [11, 12], [10, 13], [12, 13]])

The Physical Topology

PhysicalTopology.html


λ: Traffic demand per node pair (requests) in Gbps xi= 1 , X[ 1 ]= 40 for a total of 2 queues.
The traffic demand between each node pair is random following a Uniform distribution, which is centered at an identical average.
Generate and save lamda matrix traffic requests to the Traffic-Requests-for_codeHybridBypass.py_2025-4-24_12-49-48_Net(N14L21_ShnTckr_b.txt)_Run(1399)_NumOfQueues(2)_lambda.txt text file
[lamda]: Traffic demand per node pair (requests) in Gbps xi= 1 , X[ 1 ]= 40 for 2 Queues.
The traffic demand between each node pair is random following a Uniform distribution within a certain range, which is centered at an identical average. That is, given an average demand intensity X ∈ {20,40, . . . ,120} Gb/s, the actual demand between a node pair is generated by a random function uniformly distributed within the range [5,35] Gbps with mean value of the distribution X=20.
Traffic requests sample data histogram
diagonal, no traffic for m= 0 n= 0 m= 0 n= 1 m= 0 n= 2 m= 0 n= 3 m= 0 n= 4 m= 0 n= 5 m= 0 n= 6 m= 0 n= 7 m= 0 n= 8 m= 0 n= 9 m= 0 n= 10 m= 0 n= 11 m= 0 n= 12 m= 0 n= 13
m= 1 n= 0 diagonal, no traffic for m= 1 n= 1 m= 1 n= 2 m= 1 n= 3 m= 1 n= 4 m= 1 n= 5 m= 1 n= 6 m= 1 n= 7 m= 1 n= 8 m= 1 n= 9 m= 1 n= 10 m= 1 n= 11 m= 1 n= 12 m= 1 n= 13
m= 2 n= 0 m= 2 n= 1 diagonal, no traffic for m= 2 n= 2 m= 2 n= 3 m= 2 n= 4 m= 2 n= 5 m= 2 n= 6 m= 2 n= 7 m= 2 n= 8 m= 2 n= 9 m= 2 n= 10 m= 2 n= 11 m= 2 n= 12 m= 2 n= 13
m= 3 n= 0 m= 3 n= 1 m= 3 n= 2 diagonal, no traffic for m= 3 n= 3 m= 3 n= 4 m= 3 n= 5 m= 3 n= 6 m= 3 n= 7 m= 3 n= 8 m= 3 n= 9 m= 3 n= 10 m= 3 n= 11 m= 3 n= 12 m= 3 n= 13
m= 4 n= 0 m= 4 n= 1 m= 4 n= 2 m= 4 n= 3 diagonal, no traffic for m= 4 n= 4 m= 4 n= 5 m= 4 n= 6 m= 4 n= 7 m= 4 n= 8 m= 4 n= 9 m= 4 n= 10 m= 4 n= 11 m= 4 n= 12 m= 4 n= 13
m= 5 n= 0 m= 5 n= 1 m= 5 n= 2 m= 5 n= 3 m= 5 n= 4 diagonal, no traffic for m= 5 n= 5 m= 5 n= 6 m= 5 n= 7 m= 5 n= 8 m= 5 n= 9 m= 5 n= 10 m= 5 n= 11 m= 5 n= 12 m= 5 n= 13
m= 6 n= 0 m= 6 n= 1 m= 6 n= 2 m= 6 n= 3 m= 6 n= 4 m= 6 n= 5 diagonal, no traffic for m= 6 n= 6 m= 6 n= 7 m= 6 n= 8 m= 6 n= 9 m= 6 n= 10 m= 6 n= 11 m= 6 n= 12 m= 6 n= 13
m= 7 n= 0 m= 7 n= 1 m= 7 n= 2 m= 7 n= 3 m= 7 n= 4 m= 7 n= 5 m= 7 n= 6 diagonal, no traffic for m= 7 n= 7 m= 7 n= 8 m= 7 n= 9 m= 7 n= 10 m= 7 n= 11 m= 7 n= 12 m= 7 n= 13
m= 8 n= 0 m= 8 n= 1 m= 8 n= 2 m= 8 n= 3 m= 8 n= 4 m= 8 n= 5 m= 8 n= 6 m= 8 n= 7 diagonal, no traffic for m= 8 n= 8 m= 8 n= 9 m= 8 n= 10 m= 8 n= 11 m= 8 n= 12 m= 8 n= 13
m= 9 n= 0 m= 9 n= 1 m= 9 n= 2 m= 9 n= 3 m= 9 n= 4 m= 9 n= 5 m= 9 n= 6 m= 9 n= 7 m= 9 n= 8 diagonal, no traffic for m= 9 n= 9 m= 9 n= 10 m= 9 n= 11 m= 9 n= 12 m= 9 n= 13
m= 10 n= 0 m= 10 n= 1 m= 10 n= 2 m= 10 n= 3 m= 10 n= 4 m= 10 n= 5 m= 10 n= 6 m= 10 n= 7 m= 10 n= 8 m= 10 n= 9 diagonal, no traffic for m= 10 n= 10 m= 10 n= 11 m= 10 n= 12 m= 10 n= 13
m= 11 n= 0 m= 11 n= 1 m= 11 n= 2 m= 11 n= 3 m= 11 n= 4 m= 11 n= 5 m= 11 n= 6 m= 11 n= 7 m= 11 n= 8 m= 11 n= 9 m= 11 n= 10 diagonal, no traffic for m= 11 n= 11 m= 11 n= 12 m= 11 n= 13
m= 12 n= 0 m= 12 n= 1 m= 12 n= 2 m= 12 n= 3 m= 12 n= 4 m= 12 n= 5 m= 12 n= 6 m= 12 n= 7 m= 12 n= 8 m= 12 n= 9 m= 12 n= 10 m= 12 n= 11 diagonal, no traffic for m= 12 n= 12 m= 12 n= 13
m= 13 n= 0 m= 13 n= 1 m= 13 n= 2 m= 13 n= 3 m= 13 n= 4 m= 13 n= 5 m= 13 n= 6 m= 13 n= 7 m= 13 n= 8 m= 13 n= 9 m= 13 n= 10 m= 13 n= 11 m= 13 n= 12 diagonal, no traffic for m= 13 n= 13
[lamda]: Traffic demand per node pair (requests) in Gbps xi= 1 , X[ 1 ]= 40
Node0 Node1 Node2 Node3 Node4 Node5 Node6 Node7 Node8 Node9 Node10 Node11 Node12 Node13
Node0 0.000 28.978 13.190 13.992 17.721 9.178 21.474 25.417 28.849 33.309 21.126 11.165 11.056 24.583
Node1 27.886 0.000 34.253 5.227 30.614 6.378 34.242 28.089 5.971 8.067 8.812 20.627 9.936 10.180
Node2 8.515 18.525 0.000 23.637 29.213 10.878 26.031 30.975 9.596 20.555 9.638 23.368 26.956 21.262
Node3 16.747 34.179 10.458 0.000 20.666 29.528 5.338 7.901 32.882 32.965 32.530 17.014 24.472 21.778
Node4 8.748 12.300 27.245 28.558 0.000 20.646 24.465 28.173 11.487 26.748 23.098 29.158 20.156 33.784
Node5 21.052 31.774 31.194 27.380 11.203 0.000 16.247 29.913 30.251 14.437 21.096 32.886 23.113 25.708
Node6 11.910 19.594 16.583 23.828 25.600 16.444 0.000 31.776 22.101 31.724 29.764 9.775 18.192 24.006
Node7 12.377 29.927 21.425 32.280 5.474 21.239 27.134 0.000 15.747 29.005 14.494 16.710 28.555 10.357
Node8 6.818 15.407 28.299 20.126 22.069 25.481 9.307 32.057 0.000 34.510 6.560 28.586 27.812 9.942
Node9 15.179 14.467 9.403 21.812 30.016 17.237 9.215 27.922 13.938 0.000 20.662 19.803 15.920 7.400
Node10 27.036 14.658 24.743 18.079 33.410 13.448 15.516 18.744 24.855 30.641 0.000 23.731 31.202 24.043
Node11 16.593 30.229 34.692 8.909 30.485 22.355 27.490 30.070 6.041 13.445 34.577 0.000 23.372 31.968
Node12 25.440 16.488 19.089 22.353 20.262 6.217 15.891 11.392 32.124 28.470 23.490 9.302 0.000 28.126
Node13 28.603 34.134 25.537 28.847 28.825 27.588 24.980 6.702 25.215 26.167 34.927 28.741 30.433 0.000
λ: Descending order of the traffic demand per node pair (requests) in Gbps
For the High Priority Queue.
Request 0 . Node13 → Node10 required capacity 34.927
Request 1 . Node11 → Node2 required capacity 34.692
Request 2 . Node11 → Node10 required capacity 34.577
Request 3 . Node8 → Node9 required capacity 34.51
Request 4 . Node1 → Node2 required capacity 34.253
Request 5 . Node1 → Node6 required capacity 34.242
Request 6 . Node3 → Node1 required capacity 34.179
Request 7 . Node13 → Node1 required capacity 34.134
Request 8 . Node4 → Node13 required capacity 33.784
Request 9 . Node10 → Node4 required capacity 33.41
Request 10 . Node0 → Node9 required capacity 33.309
Request 11 . Node3 → Node9 required capacity 32.965
Request 12 . Node5 → Node11 required capacity 32.886
Request 13 . Node3 → Node8 required capacity 32.882
Request 14 . Node3 → Node10 required capacity 32.53
Request 15 . Node7 → Node3 required capacity 32.28
Request 16 . Node12 → Node8 required capacity 32.124
Request 17 . Node8 → Node7 required capacity 32.057
Request 18 . Node11 → Node13 required capacity 31.968
Request 19 . Node6 → Node7 required capacity 31.776
Request 20 . Node5 → Node1 required capacity 31.774
Request 21 . Node6 → Node9 required capacity 31.724
Request 22 . Node10 → Node12 required capacity 31.202
Request 23 . Node5 → Node2 required capacity 31.194
Request 24 . Node2 → Node7 required capacity 30.975
Request 25 . Node10 → Node9 required capacity 30.641
Request 26 . Node1 → Node4 required capacity 30.614
Request 27 . Node11 → Node4 required capacity 30.485
Request 28 . Node13 → Node12 required capacity 30.433
Request 29 . Node5 → Node8 required capacity 30.251
Request 30 . Node11 → Node1 required capacity 30.229
Request 31 . Node11 → Node7 required capacity 30.07
Request 32 . Node9 → Node4 required capacity 30.016
Request 33 . Node7 → Node1 required capacity 29.927
Request 34 . Node5 → Node7 required capacity 29.913
Request 35 . Node6 → Node10 required capacity 29.764
Request 36 . Node3 → Node5 required capacity 29.528
Request 37 . Node2 → Node4 required capacity 29.213
Request 38 . Node4 → Node11 required capacity 29.158
Request 39 . Node7 → Node9 required capacity 29.005
Request 40 . Node0 → Node1 required capacity 28.978
Request 41 . Node0 → Node8 required capacity 28.849
Request 42 . Node13 → Node3 required capacity 28.847
Request 43 . Node13 → Node4 required capacity 28.825
Request 44 . Node13 → Node11 required capacity 28.741
Request 45 . Node13 → Node0 required capacity 28.603
Request 46 . Node8 → Node11 required capacity 28.586
Request 47 . Node4 → Node3 required capacity 28.558
Request 48 . Node7 → Node12 required capacity 28.555
Request 49 . Node12 → Node9 required capacity 28.47
Request 50 . Node8 → Node2 required capacity 28.299
Request 51 . Node4 → Node7 required capacity 28.173
Request 52 . Node12 → Node13 required capacity 28.126
Request 53 . Node1 → Node7 required capacity 28.089
Request 54 . Node9 → Node7 required capacity 27.922
Request 55 . Node1 → Node0 required capacity 27.886
Request 56 . Node8 → Node12 required capacity 27.812
Request 57 . Node13 → Node5 required capacity 27.588
Request 58 . Node11 → Node6 required capacity 27.49
Request 59 . Node5 → Node3 required capacity 27.38
Request 60 . Node4 → Node2 required capacity 27.245
Request 61 . Node7 → Node6 required capacity 27.134
Request 62 . Node10 → Node0 required capacity 27.036
Request 63 . Node2 → Node12 required capacity 26.956
Request 64 . Node4 → Node9 required capacity 26.748
Request 65 . Node13 → Node9 required capacity 26.167
Request 66 . Node2 → Node6 required capacity 26.031
Request 67 . Node5 → Node13 required capacity 25.708
Request 68 . Node6 → Node4 required capacity 25.6
Request 69 . Node13 → Node2 required capacity 25.537
Request 70 . Node8 → Node5 required capacity 25.481
Request 71 . Node12 → Node0 required capacity 25.44
Request 72 . Node0 → Node7 required capacity 25.417
Request 73 . Node13 → Node8 required capacity 25.215
Request 74 . Node13 → Node6 required capacity 24.98
Request 75 . Node10 → Node8 required capacity 24.855
Request 76 . Node10 → Node2 required capacity 24.743
Request 77 . Node0 → Node13 required capacity 24.583
Request 78 . Node3 → Node12 required capacity 24.472
Request 79 . Node4 → Node6 required capacity 24.465
Request 80 . Node10 → Node13 required capacity 24.043
Request 81 . Node6 → Node13 required capacity 24.006
Request 82 . Node6 → Node3 required capacity 23.828
Request 83 . Node10 → Node11 required capacity 23.731
Request 84 . Node2 → Node3 required capacity 23.637
Request 85 . Node12 → Node10 required capacity 23.49
Request 86 . Node11 → Node12 required capacity 23.372
Request 87 . Node2 → Node11 required capacity 23.368
Request 88 . Node5 → Node12 required capacity 23.113
Request 89 . Node4 → Node10 required capacity 23.098
Request 90 . Node11 → Node5 required capacity 22.355
Request 91 . Node12 → Node3 required capacity 22.353
Request 92 . Node6 → Node8 required capacity 22.101
Request 93 . Node8 → Node4 required capacity 22.069
Request 94 . Node9 → Node3 required capacity 21.812
Request 95 . Node3 → Node13 required capacity 21.778
Request 96 . Node0 → Node6 required capacity 21.474
Request 97 . Node7 → Node2 required capacity 21.425
Request 98 . Node2 → Node13 required capacity 21.262
Request 99 . Node7 → Node5 required capacity 21.239
Request 100 . Node0 → Node10 required capacity 21.126
Request 101 . Node5 → Node10 required capacity 21.096
Request 102 . Node5 → Node0 required capacity 21.052
Request 103 . Node3 → Node4 required capacity 20.666
Request 104 . Node9 → Node10 required capacity 20.662
Request 105 . Node4 → Node5 required capacity 20.646
Request 106 . Node1 → Node11 required capacity 20.627
Request 107 . Node2 → Node9 required capacity 20.555
Request 108 . Node12 → Node4 required capacity 20.262
Request 109 . Node4 → Node12 required capacity 20.156
Request 110 . Node8 → Node3 required capacity 20.126
Request 111 . Node9 → Node11 required capacity 19.803
Request 112 . Node6 → Node1 required capacity 19.594
Request 113 . Node12 → Node2 required capacity 19.089
Request 114 . Node10 → Node7 required capacity 18.744
Request 115 . Node2 → Node1 required capacity 18.525
Request 116 . Node6 → Node12 required capacity 18.192
Request 117 . Node10 → Node3 required capacity 18.079
Request 118 . Node0 → Node4 required capacity 17.721
Request 119 . Node9 → Node5 required capacity 17.237
Request 120 . Node3 → Node11 required capacity 17.014
Request 121 . Node3 → Node0 required capacity 16.747
Request 122 . Node7 → Node11 required capacity 16.71
Request 123 . Node11 → Node0 required capacity 16.593
Request 124 . Node6 → Node2 required capacity 16.583
Request 125 . Node12 → Node1 required capacity 16.488
Request 126 . Node6 → Node5 required capacity 16.444
Request 127 . Node5 → Node6 required capacity 16.247
Request 128 . Node9 → Node12 required capacity 15.92
Request 129 . Node12 → Node6 required capacity 15.891
Request 130 . Node7 → Node8 required capacity 15.747
Request 131 . Node10 → Node6 required capacity 15.516
Request 132 . Node8 → Node1 required capacity 15.407
Request 133 . Node9 → Node0 required capacity 15.179
Request 134 . Node10 → Node1 required capacity 14.658
Request 135 . Node7 → Node10 required capacity 14.494
Request 136 . Node9 → Node1 required capacity 14.467
Request 137 . Node5 → Node9 required capacity 14.437
Request 138 . Node0 → Node3 required capacity 13.992
Request 139 . Node9 → Node8 required capacity 13.938
Request 140 . Node10 → Node5 required capacity 13.448
Request 141 . Node11 → Node9 required capacity 13.445
Request 142 . Node0 → Node2 required capacity 13.19
Request 143 . Node7 → Node0 required capacity 12.377
Request 144 . Node4 → Node1 required capacity 12.3
Request 145 . Node6 → Node0 required capacity 11.91
Request 146 . Node4 → Node8 required capacity 11.487
Request 147 . Node12 → Node7 required capacity 11.392
Request 148 . Node5 → Node4 required capacity 11.203
Request 149 . Node0 → Node11 required capacity 11.165
Request 150 . Node0 → Node12 required capacity 11.056
Request 151 . Node2 → Node5 required capacity 10.878
Request 152 . Node3 → Node2 required capacity 10.458
Request 153 . Node7 → Node13 required capacity 10.357
Request 154 . Node1 → Node13 required capacity 10.18
Request 155 . Node8 → Node13 required capacity 9.942
Request 156 . Node1 → Node12 required capacity 9.936
Request 157 . Node6 → Node11 required capacity 9.775
Request 158 . Node2 → Node10 required capacity 9.638
Request 159 . Node2 → Node8 required capacity 9.596
Request 160 . Node9 → Node2 required capacity 9.403
Request 161 . Node8 → Node6 required capacity 9.307
Request 162 . Node12 → Node11 required capacity 9.302
Request 163 . Node9 → Node6 required capacity 9.215
Request 164 . Node0 → Node5 required capacity 9.178
Request 165 . Node11 → Node3 required capacity 8.909
Request 166 . Node1 → Node10 required capacity 8.812
Request 167 . Node4 → Node0 required capacity 8.748
Request 168 . Node2 → Node0 required capacity 8.515
Request 169 . Node1 → Node9 required capacity 8.067
Request 170 . Node3 → Node7 required capacity 7.901
Request 171 . Node9 → Node13 required capacity 7.4
Request 172 . Node8 → Node0 required capacity 6.818
Request 173 . Node13 → Node7 required capacity 6.702
Request 174 . Node8 → Node10 required capacity 6.56
Request 175 . Node1 → Node5 required capacity 6.378
Request 176 . Node12 → Node5 required capacity 6.217
Request 177 . Node11 → Node8 required capacity 6.041
Request 178 . Node1 → Node8 required capacity 5.971
Request 179 . Node7 → Node4 required capacity 5.474
Request 180 . Node3 → Node6 required capacity 5.338
Request 181 . Node1 → Node3 required capacity 5.227
Generate and save lamda matrix traffic requests to the Traffic-Requests-for_codeHybridBypass.py_2025-4-24_12-49-48_Net(N14L21_ShnTckr_b.txt)_Run(1399)_NumOfQueues(2)_lambda.txt text file
[lamda]: Traffic demand per node pair (requests) in Gbps xi= 1 , X[ 1 ]= 40 for 2 Queues.
The traffic demand between each node pair is random following a Uniform distribution within a certain range, which is centered at an identical average. That is, given an average demand intensity X ∈ {20,40, . . . ,120} Gb/s, the actual demand between a node pair is generated by a random function uniformly distributed within the range [5,35] Gbps with mean value of the distribution X=20.
Traffic requests sample data histogram
diagonal, no traffic for m= 0 n= 0 m= 0 n= 1 m= 0 n= 2 m= 0 n= 3 m= 0 n= 4 m= 0 n= 5 m= 0 n= 6 m= 0 n= 7 m= 0 n= 8 m= 0 n= 9 m= 0 n= 10 m= 0 n= 11 m= 0 n= 12 m= 0 n= 13
m= 1 n= 0 diagonal, no traffic for m= 1 n= 1 m= 1 n= 2 m= 1 n= 3 m= 1 n= 4 m= 1 n= 5 m= 1 n= 6 m= 1 n= 7 m= 1 n= 8 m= 1 n= 9 m= 1 n= 10 m= 1 n= 11 m= 1 n= 12 m= 1 n= 13
m= 2 n= 0 m= 2 n= 1 diagonal, no traffic for m= 2 n= 2 m= 2 n= 3 m= 2 n= 4 m= 2 n= 5 m= 2 n= 6 m= 2 n= 7 m= 2 n= 8 m= 2 n= 9 m= 2 n= 10 m= 2 n= 11 m= 2 n= 12 m= 2 n= 13
m= 3 n= 0 m= 3 n= 1 m= 3 n= 2 diagonal, no traffic for m= 3 n= 3 m= 3 n= 4 m= 3 n= 5 m= 3 n= 6 m= 3 n= 7 m= 3 n= 8 m= 3 n= 9 m= 3 n= 10 m= 3 n= 11 m= 3 n= 12 m= 3 n= 13
m= 4 n= 0 m= 4 n= 1 m= 4 n= 2 m= 4 n= 3 diagonal, no traffic for m= 4 n= 4 m= 4 n= 5 m= 4 n= 6 m= 4 n= 7 m= 4 n= 8 m= 4 n= 9 m= 4 n= 10 m= 4 n= 11 m= 4 n= 12 m= 4 n= 13
m= 5 n= 0 m= 5 n= 1 m= 5 n= 2 m= 5 n= 3 m= 5 n= 4 diagonal, no traffic for m= 5 n= 5 m= 5 n= 6 m= 5 n= 7 m= 5 n= 8 m= 5 n= 9 m= 5 n= 10 m= 5 n= 11 m= 5 n= 12 m= 5 n= 13
m= 6 n= 0 m= 6 n= 1 m= 6 n= 2 m= 6 n= 3 m= 6 n= 4 m= 6 n= 5 diagonal, no traffic for m= 6 n= 6 m= 6 n= 7 m= 6 n= 8 m= 6 n= 9 m= 6 n= 10 m= 6 n= 11 m= 6 n= 12 m= 6 n= 13
m= 7 n= 0 m= 7 n= 1 m= 7 n= 2 m= 7 n= 3 m= 7 n= 4 m= 7 n= 5 m= 7 n= 6 diagonal, no traffic for m= 7 n= 7 m= 7 n= 8 m= 7 n= 9 m= 7 n= 10 m= 7 n= 11 m= 7 n= 12 m= 7 n= 13
m= 8 n= 0 m= 8 n= 1 m= 8 n= 2 m= 8 n= 3 m= 8 n= 4 m= 8 n= 5 m= 8 n= 6 m= 8 n= 7 diagonal, no traffic for m= 8 n= 8 m= 8 n= 9 m= 8 n= 10 m= 8 n= 11 m= 8 n= 12 m= 8 n= 13
m= 9 n= 0 m= 9 n= 1 m= 9 n= 2 m= 9 n= 3 m= 9 n= 4 m= 9 n= 5 m= 9 n= 6 m= 9 n= 7 m= 9 n= 8 diagonal, no traffic for m= 9 n= 9 m= 9 n= 10 m= 9 n= 11 m= 9 n= 12 m= 9 n= 13
m= 10 n= 0 m= 10 n= 1 m= 10 n= 2 m= 10 n= 3 m= 10 n= 4 m= 10 n= 5 m= 10 n= 6 m= 10 n= 7 m= 10 n= 8 m= 10 n= 9 diagonal, no traffic for m= 10 n= 10 m= 10 n= 11 m= 10 n= 12 m= 10 n= 13
m= 11 n= 0 m= 11 n= 1 m= 11 n= 2 m= 11 n= 3 m= 11 n= 4 m= 11 n= 5 m= 11 n= 6 m= 11 n= 7 m= 11 n= 8 m= 11 n= 9 m= 11 n= 10 diagonal, no traffic for m= 11 n= 11 m= 11 n= 12 m= 11 n= 13
m= 12 n= 0 m= 12 n= 1 m= 12 n= 2 m= 12 n= 3 m= 12 n= 4 m= 12 n= 5 m= 12 n= 6 m= 12 n= 7 m= 12 n= 8 m= 12 n= 9 m= 12 n= 10 m= 12 n= 11 diagonal, no traffic for m= 12 n= 12 m= 12 n= 13
m= 13 n= 0 m= 13 n= 1 m= 13 n= 2 m= 13 n= 3 m= 13 n= 4 m= 13 n= 5 m= 13 n= 6 m= 13 n= 7 m= 13 n= 8 m= 13 n= 9 m= 13 n= 10 m= 13 n= 11 m= 13 n= 12 diagonal, no traffic for m= 13 n= 13
[lamda]: Traffic demand per node pair (requests) in Gbps xi= 1 , X[ 1 ]= 40
Node0 Node1 Node2 Node3 Node4 Node5 Node6 Node7 Node8 Node9 Node10 Node11 Node12 Node13
Node0 0.000 8.872 26.443 24.887 31.065 19.497 25.539 8.902 5.367 11.083 11.722 6.223 34.926 29.793
Node1 11.542 0.000 21.077 23.399 9.019 22.818 18.229 13.927 13.921 29.809 16.357 5.355 22.079 14.049
Node2 18.795 17.542 0.000 22.619 8.977 15.655 25.529 27.771 29.530 27.755 10.595 24.083 32.246 30.028
Node3 19.483 11.723 15.335 0.000 13.607 19.860 13.729 11.511 8.376 12.885 19.744 5.590 5.731 30.282
Node4 24.736 6.078 5.114 30.752 0.000 10.165 5.388 20.125 29.038 27.381 9.525 9.926 23.906 17.237
Node5 5.756 12.723 25.642 30.650 26.255 0.000 7.960 7.615 13.557 27.551 16.490 10.729 26.022 5.425
Node6 21.056 25.614 24.514 22.947 8.925 22.299 0.000 29.278 20.407 25.857 7.941 14.138 17.360 23.393
Node7 31.178 5.815 29.346 10.158 8.761 22.092 19.464 0.000 18.122 30.096 29.452 34.015 5.434 7.773
Node8 13.689 30.205 5.942 11.521 34.291 13.044 32.642 14.464 0.000 21.641 28.039 31.492 27.520 20.270
Node9 30.483 22.372 29.097 24.628 27.590 14.520 28.296 26.002 26.269 0.000 27.087 9.865 26.131 23.112
Node10 15.679 27.400 22.212 19.468 32.788 19.406 12.843 28.698 32.479 27.053 0.000 10.386 24.566 21.436
Node11 32.374 23.021 15.710 22.011 19.476 22.667 29.924 23.399 10.691 25.534 22.283 0.000 24.895 9.603
Node12 8.095 24.854 5.843 32.899 10.516 11.709 15.867 28.393 27.495 15.523 27.872 30.118 0.000 11.224
Node13 6.644 25.479 20.525 7.403 22.240 14.754 7.438 14.151 34.820 34.296 28.438 24.927 15.236 0.000
λ: Descending order of the traffic demand per node pair (requests) in Gbps
For the Low Priority Queue.
Request 0 . Node0 → Node12 required capacity 34.926
Request 1 . Node13 → Node8 required capacity 34.82
Request 2 . Node13 → Node9 required capacity 34.296
Request 3 . Node8 → Node4 required capacity 34.291
Request 4 . Node7 → Node11 required capacity 34.015
Request 5 . Node12 → Node3 required capacity 32.899
Request 6 . Node10 → Node4 required capacity 32.788
Request 7 . Node8 → Node6 required capacity 32.642
Request 8 . Node10 → Node8 required capacity 32.479
Request 9 . Node11 → Node0 required capacity 32.374
Request 10 . Node2 → Node12 required capacity 32.246
Request 11 . Node8 → Node11 required capacity 31.492
Request 12 . Node7 → Node0 required capacity 31.178
Request 13 . Node0 → Node4 required capacity 31.065
Request 14 . Node4 → Node3 required capacity 30.752
Request 15 . Node5 → Node3 required capacity 30.65
Request 16 . Node9 → Node0 required capacity 30.483
Request 17 . Node3 → Node13 required capacity 30.282
Request 18 . Node8 → Node1 required capacity 30.205
Request 19 . Node12 → Node11 required capacity 30.118
Request 20 . Node7 → Node9 required capacity 30.096
Request 21 . Node2 → Node13 required capacity 30.028
Request 22 . Node11 → Node6 required capacity 29.924
Request 23 . Node1 → Node9 required capacity 29.809
Request 24 . Node0 → Node13 required capacity 29.793
Request 25 . Node2 → Node8 required capacity 29.53
Request 26 . Node7 → Node10 required capacity 29.452
Request 27 . Node7 → Node2 required capacity 29.346
Request 28 . Node6 → Node7 required capacity 29.278
Request 29 . Node9 → Node2 required capacity 29.097
Request 30 . Node4 → Node8 required capacity 29.038
Request 31 . Node10 → Node7 required capacity 28.698
Request 32 . Node13 → Node10 required capacity 28.438
Request 33 . Node12 → Node7 required capacity 28.393
Request 34 . Node9 → Node6 required capacity 28.296
Request 35 . Node8 → Node10 required capacity 28.039
Request 36 . Node12 → Node10 required capacity 27.872
Request 37 . Node2 → Node7 required capacity 27.771
Request 38 . Node2 → Node9 required capacity 27.755
Request 39 . Node9 → Node4 required capacity 27.59
Request 40 . Node5 → Node9 required capacity 27.551
Request 41 . Node8 → Node12 required capacity 27.52
Request 42 . Node12 → Node8 required capacity 27.495
Request 43 . Node10 → Node1 required capacity 27.4
Request 44 . Node4 → Node9 required capacity 27.381
Request 45 . Node9 → Node10 required capacity 27.087
Request 46 . Node10 → Node9 required capacity 27.053
Request 47 . Node0 → Node2 required capacity 26.443
Request 48 . Node9 → Node8 required capacity 26.269
Request 49 . Node5 → Node4 required capacity 26.255
Request 50 . Node9 → Node12 required capacity 26.131
Request 51 . Node5 → Node12 required capacity 26.022
Request 52 . Node9 → Node7 required capacity 26.002
Request 53 . Node6 → Node9 required capacity 25.857
Request 54 . Node5 → Node2 required capacity 25.642
Request 55 . Node6 → Node1 required capacity 25.614
Request 56 . Node0 → Node6 required capacity 25.539
Request 57 . Node11 → Node9 required capacity 25.534
Request 58 . Node2 → Node6 required capacity 25.529
Request 59 . Node13 → Node1 required capacity 25.479
Request 60 . Node13 → Node11 required capacity 24.927
Request 61 . Node11 → Node12 required capacity 24.895
Request 62 . Node0 → Node3 required capacity 24.887
Request 63 . Node12 → Node1 required capacity 24.854
Request 64 . Node4 → Node0 required capacity 24.736
Request 65 . Node9 → Node3 required capacity 24.628
Request 66 . Node10 → Node12 required capacity 24.566
Request 67 . Node6 → Node2 required capacity 24.514
Request 68 . Node2 → Node11 required capacity 24.083
Request 69 . Node4 → Node12 required capacity 23.906
Request 70 . Node1 → Node3 required capacity 23.399
Request 71 . Node11 → Node7 required capacity 23.399
Request 72 . Node6 → Node13 required capacity 23.393
Request 73 . Node9 → Node13 required capacity 23.112
Request 74 . Node11 → Node1 required capacity 23.021
Request 75 . Node6 → Node3 required capacity 22.947
Request 76 . Node1 → Node5 required capacity 22.818
Request 77 . Node11 → Node5 required capacity 22.667
Request 78 . Node2 → Node3 required capacity 22.619
Request 79 . Node9 → Node1 required capacity 22.372
Request 80 . Node6 → Node5 required capacity 22.299
Request 81 . Node11 → Node10 required capacity 22.283
Request 82 . Node13 → Node4 required capacity 22.24
Request 83 . Node10 → Node2 required capacity 22.212
Request 84 . Node7 → Node5 required capacity 22.092
Request 85 . Node1 → Node12 required capacity 22.079
Request 86 . Node11 → Node3 required capacity 22.011
Request 87 . Node8 → Node9 required capacity 21.641
Request 88 . Node10 → Node13 required capacity 21.436
Request 89 . Node1 → Node2 required capacity 21.077
Request 90 . Node6 → Node0 required capacity 21.056
Request 91 . Node13 → Node2 required capacity 20.525
Request 92 . Node6 → Node8 required capacity 20.407
Request 93 . Node8 → Node13 required capacity 20.27
Request 94 . Node4 → Node7 required capacity 20.125
Request 95 . Node3 → Node5 required capacity 19.86
Request 96 . Node3 → Node10 required capacity 19.744
Request 97 . Node0 → Node5 required capacity 19.497
Request 98 . Node3 → Node0 required capacity 19.483
Request 99 . Node11 → Node4 required capacity 19.476
Request 100 . Node10 → Node3 required capacity 19.468
Request 101 . Node7 → Node6 required capacity 19.464
Request 102 . Node10 → Node5 required capacity 19.406
Request 103 . Node2 → Node0 required capacity 18.795
Request 104 . Node1 → Node6 required capacity 18.229
Request 105 . Node7 → Node8 required capacity 18.122
Request 106 . Node2 → Node1 required capacity 17.542
Request 107 . Node6 → Node12 required capacity 17.36
Request 108 . Node4 → Node13 required capacity 17.237
Request 109 . Node5 → Node10 required capacity 16.49
Request 110 . Node1 → Node10 required capacity 16.357
Request 111 . Node12 → Node6 required capacity 15.867
Request 112 . Node11 → Node2 required capacity 15.71
Request 113 . Node10 → Node0 required capacity 15.679
Request 114 . Node2 → Node5 required capacity 15.655
Request 115 . Node12 → Node9 required capacity 15.523
Request 116 . Node3 → Node2 required capacity 15.335
Request 117 . Node13 → Node12 required capacity 15.236
Request 118 . Node13 → Node5 required capacity 14.754
Request 119 . Node9 → Node5 required capacity 14.52
Request 120 . Node8 → Node7 required capacity 14.464
Request 121 . Node13 → Node7 required capacity 14.151
Request 122 . Node6 → Node11 required capacity 14.138
Request 123 . Node1 → Node13 required capacity 14.049
Request 124 . Node1 → Node7 required capacity 13.927
Request 125 . Node1 → Node8 required capacity 13.921
Request 126 . Node3 → Node6 required capacity 13.729
Request 127 . Node8 → Node0 required capacity 13.689
Request 128 . Node3 → Node4 required capacity 13.607
Request 129 . Node5 → Node8 required capacity 13.557
Request 130 . Node8 → Node5 required capacity 13.044
Request 131 . Node3 → Node9 required capacity 12.885
Request 132 . Node10 → Node6 required capacity 12.843
Request 133 . Node5 → Node1 required capacity 12.723
Request 134 . Node3 → Node1 required capacity 11.723
Request 135 . Node0 → Node10 required capacity 11.722
Request 136 . Node12 → Node5 required capacity 11.709
Request 137 . Node1 → Node0 required capacity 11.542
Request 138 . Node8 → Node3 required capacity 11.521
Request 139 . Node3 → Node7 required capacity 11.511
Request 140 . Node12 → Node13 required capacity 11.224
Request 141 . Node0 → Node9 required capacity 11.083
Request 142 . Node5 → Node11 required capacity 10.729
Request 143 . Node11 → Node8 required capacity 10.691
Request 144 . Node2 → Node10 required capacity 10.595
Request 145 . Node12 → Node4 required capacity 10.516
Request 146 . Node10 → Node11 required capacity 10.386
Request 147 . Node4 → Node5 required capacity 10.165
Request 148 . Node7 → Node3 required capacity 10.158
Request 149 . Node4 → Node11 required capacity 9.926
Request 150 . Node9 → Node11 required capacity 9.865
Request 151 . Node11 → Node13 required capacity 9.603
Request 152 . Node4 → Node10 required capacity 9.525
Request 153 . Node1 → Node4 required capacity 9.019
Request 154 . Node2 → Node4 required capacity 8.977
Request 155 . Node6 → Node4 required capacity 8.925
Request 156 . Node0 → Node7 required capacity 8.902
Request 157 . Node0 → Node1 required capacity 8.872
Request 158 . Node7 → Node4 required capacity 8.761
Request 159 . Node3 → Node8 required capacity 8.376
Request 160 . Node12 → Node0 required capacity 8.095
Request 161 . Node5 → Node6 required capacity 7.96
Request 162 . Node6 → Node10 required capacity 7.941
Request 163 . Node7 → Node13 required capacity 7.773
Request 164 . Node5 → Node7 required capacity 7.615
Request 165 . Node13 → Node6 required capacity 7.438
Request 166 . Node13 → Node3 required capacity 7.403
Request 167 . Node13 → Node0 required capacity 6.644
Request 168 . Node0 → Node11 required capacity 6.223
Request 169 . Node4 → Node1 required capacity 6.078
Request 170 . Node8 → Node2 required capacity 5.942
Request 171 . Node12 → Node2 required capacity 5.843
Request 172 . Node7 → Node1 required capacity 5.815
Request 173 . Node5 → Node0 required capacity 5.756
Request 174 . Node3 → Node12 required capacity 5.731
Request 175 . Node3 → Node11 required capacity 5.59
Request 176 . Node7 → Node12 required capacity 5.434
Request 177 . Node5 → Node13 required capacity 5.425
Request 178 . Node4 → Node6 required capacity 5.388
Request 179 . Node0 → Node8 required capacity 5.367
Request 180 . Node1 → Node11 required capacity 5.355
Request 181 . Node4 → Node2 required capacity 5.114
λ: Descending order of the traffic demand per node pair (requests) in Gbps
For the aggregated traffic from the traffic requests of all queues, per source, destination, in descending order.
Request 0 . Node10 → Node4 required capacity 66.198
Request 1 . Node13 → Node10 required capacity 63.365
Request 2 . Node6 → Node7 required capacity 61.054
Request 3 . Node13 → Node9 required capacity 60.463
Request 4 . Node8 → Node11 required capacity 60.078
Request 5 . Node13 → Node8 required capacity 60.035
Request 6 . Node12 → Node8 required capacity 59.619
Request 7 . Node13 → Node1 required capacity 59.613
Request 8 . Node4 → Node3 required capacity 59.31
Request 9 . Node2 → Node12 required capacity 59.202
Request 10 . Node7 → Node9 required capacity 59.101
Request 11 . Node2 → Node7 required capacity 58.746
Request 12 . Node5 → Node3 required capacity 58.03
Request 13 . Node10 → Node9 required capacity 57.694
Request 14 . Node9 → Node4 required capacity 57.606
Request 15 . Node6 → Node9 required capacity 57.581
Request 16 . Node11 → Node6 required capacity 57.414
Request 17 . Node10 → Node8 required capacity 57.334
Request 18 . Node11 → Node10 required capacity 56.86
Request 19 . Node5 → Node2 required capacity 56.836
Request 20 . Node8 → Node4 required capacity 56.36
Request 21 . Node8 → Node9 required capacity 56.151
Request 22 . Node10 → Node12 required capacity 55.768
Request 23 . Node8 → Node12 required capacity 55.332
Request 24 . Node1 → Node2 required capacity 55.33
Request 25 . Node12 → Node3 required capacity 55.252
Request 26 . Node0 → Node13 required capacity 54.376
Request 27 . Node4 → Node9 required capacity 54.129
Request 28 . Node9 → Node7 required capacity 53.924
Request 29 . Node13 → Node11 required capacity 53.668
Request 30 . Node11 → Node7 required capacity 53.469
Request 31 . Node11 → Node1 required capacity 53.25
Request 32 . Node1 → Node6 required capacity 52.471
Request 33 . Node3 → Node10 required capacity 52.274
Request 34 . Node3 → Node13 required capacity 52.06
Request 35 . Node2 → Node6 required capacity 51.56
Request 36 . Node12 → Node10 required capacity 51.362
Request 37 . Node2 → Node13 required capacity 51.29
Request 38 . Node13 → Node4 required capacity 51.065
Request 39 . Node4 → Node13 required capacity 51.021
Request 40 . Node7 → Node2 required capacity 50.771
Request 41 . Node7 → Node11 required capacity 50.725
Request 42 . Node11 → Node2 required capacity 50.402
Request 43 . Node11 → Node4 required capacity 49.961
Request 44 . Node3 → Node5 required capacity 49.388
Request 45 . Node5 → Node12 required capacity 49.135
Request 46 . Node11 → Node0 required capacity 48.967
Request 47 . Node0 → Node4 required capacity 48.786
Request 48 . Node2 → Node9 required capacity 48.31
Request 49 . Node4 → Node7 required capacity 48.298
Request 50 . Node11 → Node12 required capacity 48.267
Request 51 . Node9 → Node10 required capacity 47.749
Request 52 . Node2 → Node11 required capacity 47.451
Request 53 . Node10 → Node7 required capacity 47.442
Request 54 . Node6 → Node13 required capacity 47.399
Request 55 . Node0 → Node6 required capacity 47.013
Request 56 . Node10 → Node2 required capacity 46.955
Request 57 . Node6 → Node3 required capacity 46.775
Request 58 . Node7 → Node6 required capacity 46.598
Request 59 . Node8 → Node7 required capacity 46.521
Request 60 . Node9 → Node3 required capacity 46.44
Request 61 . Node2 → Node3 required capacity 46.256
Request 62 . Node13 → Node2 required capacity 46.062
Request 63 . Node0 → Node12 required capacity 45.982
Request 64 . Node3 → Node1 required capacity 45.902
Request 65 . Node3 → Node9 required capacity 45.85
Request 66 . Node13 → Node12 required capacity 45.669
Request 67 . Node9 → Node0 required capacity 45.662
Request 68 . Node8 → Node1 required capacity 45.612
Request 69 . Node10 → Node13 required capacity 45.479
Request 70 . Node6 → Node1 required capacity 45.208
Request 71 . Node11 → Node5 required capacity 45.022
Request 72 . Node5 → Node1 required capacity 44.497
Request 73 . Node0 → Node9 required capacity 44.392
Request 74 . Node4 → Node12 required capacity 44.062
Request 75 . Node12 → Node9 required capacity 43.993
Request 76 . Node7 → Node10 required capacity 43.946
Request 77 . Node5 → Node8 required capacity 43.808
Request 78 . Node5 → Node11 required capacity 43.615
Request 79 . Node7 → Node0 required capacity 43.555
Request 80 . Node7 → Node5 required capacity 43.331
Request 81 . Node10 → Node0 required capacity 42.715
Request 82 . Node6 → Node8 required capacity 42.508
Request 83 . Node7 → Node3 required capacity 42.438
Request 84 . Node13 → Node5 required capacity 42.342
Request 85 . Node10 → Node1 required capacity 42.058
Request 86 . Node9 → Node12 required capacity 42.051
Request 87 . Node1 → Node7 required capacity 42.016
Request 88 . Node5 → Node9 required capacity 41.988
Request 89 . Node8 → Node6 required capacity 41.949
Request 90 . Node11 → Node13 required capacity 41.571
Request 91 . Node12 → Node1 required capacity 41.342
Request 92 . Node3 → Node8 required capacity 41.258
Request 93 . Node6 → Node2 required capacity 41.097
Request 94 . Node4 → Node8 required capacity 40.525
Request 95 . Node9 → Node8 required capacity 40.207
Request 96 . Node12 → Node7 required capacity 39.785
Request 97 . Node1 → Node4 required capacity 39.633
Request 98 . Node0 → Node2 required capacity 39.633
Request 99 . Node1 → Node0 required capacity 39.428
Request 100 . Node12 → Node11 required capacity 39.42
Request 101 . Node12 → Node13 required capacity 39.35
Request 102 . Node2 → Node8 required capacity 39.126
Request 103 . Node4 → Node11 required capacity 39.084
Request 104 . Node11 → Node9 required capacity 38.979
Request 105 . Node0 → Node3 required capacity 38.879
Request 106 . Node6 → Node5 required capacity 38.743
Request 107 . Node8 → Node5 required capacity 38.525
Request 108 . Node9 → Node2 required capacity 38.5
Request 109 . Node2 → Node4 required capacity 38.19
Request 110 . Node1 → Node9 required capacity 37.876
Request 111 . Node0 → Node1 required capacity 37.85
Request 112 . Node6 → Node10 required capacity 37.705
Request 113 . Node5 → Node10 required capacity 37.586
Request 114 . Node10 → Node3 required capacity 37.547
Request 115 . Node5 → Node7 required capacity 37.528
Request 116 . Node9 → Node6 required capacity 37.511
Request 117 . Node5 → Node4 required capacity 37.458
Request 118 . Node9 → Node1 required capacity 36.839
Request 119 . Node13 → Node3 required capacity 36.25
Request 120 . Node3 → Node0 required capacity 36.23
Request 121 . Node2 → Node1 required capacity 36.067
Request 122 . Node7 → Node1 required capacity 35.742
Request 123 . Node6 → Node12 required capacity 35.552
Request 124 . Node13 → Node0 required capacity 35.247
Request 125 . Node8 → Node10 required capacity 34.599
Request 126 . Node6 → Node4 required capacity 34.525
Request 127 . Node0 → Node7 required capacity 34.319
Request 128 . Node3 → Node4 required capacity 34.273
Request 129 . Node8 → Node2 required capacity 34.241
Request 130 . Node0 → Node8 required capacity 34.216
Request 131 . Node10 → Node11 required capacity 34.117
Request 132 . Node7 → Node12 required capacity 33.989
Request 133 . Node7 → Node8 required capacity 33.869
Request 134 . Node12 → Node0 required capacity 33.535
Request 135 . Node4 → Node0 required capacity 33.484
Request 136 . Node6 → Node0 required capacity 32.966
Request 137 . Node10 → Node5 required capacity 32.854
Request 138 . Node0 → Node10 required capacity 32.848
Request 139 . Node4 → Node10 required capacity 32.623
Request 140 . Node13 → Node6 required capacity 32.418
Request 141 . Node4 → Node2 required capacity 32.359
Request 142 . Node1 → Node12 required capacity 32.015
Request 143 . Node12 → Node6 required capacity 31.758
Request 144 . Node9 → Node5 required capacity 31.757
Request 145 . Node8 → Node3 required capacity 31.647
Request 146 . Node5 → Node13 required capacity 31.133
Request 147 . Node11 → Node3 required capacity 30.92
Request 148 . Node4 → Node5 required capacity 30.811
Request 149 . Node12 → Node4 required capacity 30.778
Request 150 . Node9 → Node13 required capacity 30.512
Request 151 . Node8 → Node13 required capacity 30.212
Request 152 . Node3 → Node12 required capacity 30.203
Request 153 . Node4 → Node6 required capacity 29.853
Request 154 . Node9 → Node11 required capacity 29.668
Request 155 . Node1 → Node5 required capacity 29.196
Request 156 . Node0 → Node5 required capacity 28.675
Request 157 . Node1 → Node3 required capacity 28.626
Request 158 . Node10 → Node6 required capacity 28.359
Request 159 . Node2 → Node0 required capacity 27.31
Request 160 . Node5 → Node0 required capacity 26.808
Request 161 . Node2 → Node5 required capacity 26.533
Request 162 . Node1 → Node11 required capacity 25.982
Request 163 . Node3 → Node2 required capacity 25.793
Request 164 . Node1 → Node10 required capacity 25.169
Request 165 . Node12 → Node2 required capacity 24.932
Request 166 . Node1 → Node13 required capacity 24.229
Request 167 . Node5 → Node6 required capacity 24.207
Request 168 . Node6 → Node11 required capacity 23.913
Request 169 . Node3 → Node11 required capacity 22.604
Request 170 . Node13 → Node7 required capacity 20.853
Request 171 . Node8 → Node0 required capacity 20.507
Request 172 . Node2 → Node10 required capacity 20.233
Request 173 . Node1 → Node8 required capacity 19.892
Request 174 . Node3 → Node7 required capacity 19.412
Request 175 . Node3 → Node6 required capacity 19.067
Request 176 . Node4 → Node1 required capacity 18.378
Request 177 . Node7 → Node13 required capacity 18.13
Request 178 . Node12 → Node5 required capacity 17.926
Request 179 . Node0 → Node11 required capacity 17.388
Request 180 . Node11 → Node8 required capacity 16.732
Request 181 . Node7 → Node4 required capacity 14.235
Σλid: Traffic data from low end routers at node i in Gbps
NodeData in GbpsΔi
Node10 594.52 15.0
Node13 607.05 16.0
Node6 545.026 14.0
Node8 551.734 14.0
Node12 509.052 13.0
Node4 513.937 13.0
Node2 550.274 14.0
Node7 516.43 13.0
Node5 532.629 14.0
Node9 538.426 14.0
Node11 591.814 15.0
Node1 451.863 12.0
Node0 504.357 13.0
Node3 474.314 12.0
Σλid: Traffic data from low end routers at node i in Gbps for Queue: High Priority
NodeData in GbpsΔi
Node13 350.699 9.0
Node11 310.226 8.0
Node8 266.974 7.0
Node1 230.282 6.0
Node3 286.458 8.0
Node4 294.566 8.0
Node10 300.106 8.0
Node0 260.038 7.0
Node5 316.254 8.0
Node7 264.724 7.0
Node12 258.644 7.0
Node6 281.297 8.0
Node2 259.149 7.0
Node9 222.974 6.0
Σλid: Traffic data from low end routers at node i in Gbps for Queue: Low Priority
NodeData in GbpsΔi
Node0 244.319 7.0
Node13 256.351 7.0
Node8 284.76 8.0
Node7 251.706 7.0
Node12 250.408 7.0
Node10 294.414 8.0
Node11 281.588 8.0
Node2 291.125 8.0
Node4 219.371 6.0
Node5 216.375 6.0
Node9 315.452 8.0
Node3 187.856 5.0
Node1 221.581 6.0
Node6 263.729 7.0
Routing traffic requests of the single queue over the Virtual Topology (a.k.a. Adding requests to the Virtual Topology)
Step numberQueueRequestFromTo Required/RemainActionsOutcomes Current Virtual TopologyCurrent request processing start (msec)
Step 1Processing queue 0request 0from Node13 (13)to Node10 (10) Remain: 34.927 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 13 to 10 .
  • A new virtual link (13, 10, 0) is created for queue 0 , request 0 , from Node13 to Node10 capacity requirement 34.927 Gbps, having free capacity 5.073 Gbps.
  • New virtual link (13, 10) is appended.
  • Capacities are [5.073]
  • que 0 req 0 (src 13 dst 10 num 0) type New capacity 34.927 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(13,10)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,10,0)[(0,0,34.927,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,10,0)[34.927,5.073,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,0)[(13,10,0,'New',34.927,0,0)]
    Virtual Topology vT = {13: [10]}

    VT_after_Step1_Que0_Req0.html

    Time of processing all requests 0.064, Time of current queue's turn 0.064
    Step 2Processing queue 0request 1from Node11 (11)to Node2 (2) Remain: 34.692 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 11 to 2 .
  • A new virtual link (11, 2, 0) is created for queue 0 , request 1 , from Node11 to Node2 capacity requirement 34.692 Gbps, having free capacity 5.308 Gbps.
  • New virtual link (11, 2) is appended.
  • Capacities are [5.308]
  • que 0 req 1 (src 11 dst 2 num 0) type New capacity 34.692 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(11,2)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,2,0)[(0,1,34.692,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,2,0)[34.692,5.308,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,1)[(11,2,0,'New',34.692,0,0)]
    Virtual Topology vT = {13: [10], 11: [2]}

    VT_after_Step2_Que0_Req1.html

    Time of processing all requests 41.653, Time of current queue's turn 41.653
    Step 3Processing queue 0request 2from Node11 (11)to Node10 (10) Remain: 34.577 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 11 to 10 .
  • A new virtual link (11, 10, 0) is created for queue 0 , request 2 , from Node11 to Node10 capacity requirement 34.577 Gbps, having free capacity 5.423 Gbps.
  • New neighbour 10 is appended.
  • New virtual link (11, 10) is appended.
  • Capacities are [5.423]
  • que 0 req 2 (src 11 dst 10 num 0) type New capacity 34.577 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(11,10)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,10,0)[(0,2,34.577,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,10,0)[34.577,5.423,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,2)[(11,10,0,'New',34.577,0,0)]
    Virtual Topology vT = {13: [10], 11: [2, 10]}

    VT_after_Step3_Que0_Req2.html

    Time of processing all requests 46.263, Time of current queue's turn 46.263
    Step 4Processing queue 0request 3from Node8 (8)to Node9 (9) Remain: 34.51 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 8 to 9 .
  • A new virtual link (8, 9, 0) is created for queue 0 , request 3 , from Node8 to Node9 capacity requirement 34.51 Gbps, having free capacity 5.49 Gbps.
  • New virtual link (8, 9) is appended.
  • Capacities are [5.49]
  • que 0 req 3 (src 8 dst 9 num 0) type New capacity 34.510 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(8,9)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,9,0)[(0,3,34.510,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,9,0)[34.510,5.490,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,3)[(8,9,0,'New',34.510,0,0)]
    Virtual Topology vT = {13: [10], 11: [2, 10], 8: [9]}

    VT_after_Step4_Que0_Req3.html

    Time of processing all requests 51.196, Time of current queue's turn 51.196
    Step 5Processing queue 0request 4from Node1 (1)to Node2 (2) Remain: 34.253 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 1 to 2 .
  • A new virtual link (1, 2, 0) is created for queue 0 , request 4 , from Node1 to Node2 capacity requirement 34.253 Gbps, having free capacity 5.747 Gbps.
  • New virtual link (1, 2) is appended.
  • Capacities are [5.747]
  • que 0 req 4 (src 1 dst 2 num 0) type New capacity 34.253 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(1,2)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(1,2,0)[(0,4,34.253,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,2,0)[34.253,5.747,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,4)[(1,2,0,'New',34.253,0,0)]
    Virtual Topology vT = {13: [10], 11: [2, 10], 8: [9], 1: [2]}

    VT_after_Step5_Que0_Req4.html

    Time of processing all requests 56.301, Time of current queue's turn 56.301
    Step 6Processing queue 0request 5from Node1 (1)to Node6 (6) Remain: 34.242 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 1 to 6 .
  • A new virtual link (1, 6, 0) is created for queue 0 , request 5 , from Node1 to Node6 capacity requirement 34.242 Gbps, having free capacity 5.758 Gbps.
  • New neighbour 6 is appended.
  • New virtual link (1, 6) is appended.
  • Capacities are [5.758]
  • que 0 req 5 (src 1 dst 6 num 0) type New capacity 34.242 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(1,6)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(1,6,0)[(0,5,34.242,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,6,0)[34.242,5.758,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,5)[(1,6,0,'New',34.242,0,0)]
    Virtual Topology vT = {13: [10], 11: [2, 10], 8: [9], 1: [2, 6]}

    VT_after_Step6_Que0_Req5.html

    Time of processing all requests 61.445, Time of current queue's turn 61.445
    Step 7Processing queue 0request 6from Node3 (3)to Node1 (1) Remain: 34.179 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 3 to 1 .
  • A new virtual link (3, 1, 0) is created for queue 0 , request 6 , from Node3 to Node1 capacity requirement 34.179 Gbps, having free capacity 5.821 Gbps.
  • New virtual link (3, 1) is appended.
  • Capacities are [5.821]
  • que 0 req 6 (src 3 dst 1 num 0) type New capacity 34.179 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(3,1)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,1,0)[(0,6,34.179,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,1,0)[34.179,5.821,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,6)[(3,1,0,'New',34.179,0,0)]
    Virtual Topology vT = {13: [10], 11: [2, 10], 8: [9], 1: [2, 6], 3: [1]}

    VT_after_Step7_Que0_Req6.html

    Time of processing all requests 66.398, Time of current queue's turn 66.398
    Step 8Processing queue 0request 7from Node13 (13)to Node1 (1) Remain: 34.134 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 13 to 1 .
  • A new virtual link (13, 1, 0) is created for queue 0 , request 7 , from Node13 to Node1 capacity requirement 34.134 Gbps, having free capacity 5.866 Gbps.
  • New neighbour 1 is appended.
  • New virtual link (13, 1) is appended.
  • Capacities are [5.866]
  • que 0 req 7 (src 13 dst 1 num 0) type New capacity 34.134 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(13,1)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,1,0)[(0,7,34.134,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,1,0)[34.134,5.866,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,7)[(13,1,0,'New',34.134,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10], 8: [9], 1: [2, 6], 3: [1]}

    VT_after_Step8_Que0_Req7.html

    Time of processing all requests 71.895, Time of current queue's turn 71.895
    Step 9Processing queue 0request 8from Node4 (4)to Node13 (13) Remain: 33.784 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 4 to 13 .
  • A new virtual link (4, 13, 0) is created for queue 0 , request 8 , from Node4 to Node13 capacity requirement 33.784 Gbps, having free capacity 6.216 Gbps.
  • New virtual link (4, 13) is appended.
  • Capacities are [6.216]
  • que 0 req 8 (src 4 dst 13 num 0) type New capacity 33.784 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(4,13)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,13,0)[(0,8,33.784,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,13,0)[33.784,6.216,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,8)[(4,13,0,'New',33.784,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10], 8: [9], 1: [2, 6], 3: [1], 4: [13]}

    VT_after_Step9_Que0_Req8.html

    Time of processing all requests 76.879, Time of current queue's turn 76.879
    Step 10Processing queue 0request 9from Node10 (10)to Node4 (4) Remain: 33.41 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 10 to 4 .
  • A new virtual link (10, 4, 0) is created for queue 0 , request 9 , from Node10 to Node4 capacity requirement 33.41 Gbps, having free capacity 6.59 Gbps.
  • New virtual link (10, 4) is appended.
  • Capacities are [6.59]
  • que 0 req 9 (src 10 dst 4 num 0) type New capacity 33.410 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(10,4)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,4,0)[(0,9,33.410,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,4,0)[33.410,6.590,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,9)[(10,4,0,'New',33.410,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10], 8: [9], 1: [2, 6], 3: [1], 4: [13], 10: [4]}

    VT_after_Step10_Que0_Req9.html

    Time of processing all requests 81.887, Time of current queue's turn 81.887
    Step 11Processing queue 0request 10from Node0 (0)to Node9 (9) Remain: 33.309 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 0 to 9 .
  • A new virtual link (0, 9, 0) is created for queue 0 , request 10 , from Node0 to Node9 capacity requirement 33.309 Gbps, having free capacity 6.691 Gbps.
  • New virtual link (0, 9) is appended.
  • Capacities are [6.691]
  • que 0 req 10 (src 0 dst 9 num 0) type New capacity 33.309 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(0,9)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,9,0)[(0,10,33.309,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,9,0)[33.309,6.691,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,10)[(0,9,0,'New',33.309,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10], 8: [9], 1: [2, 6], 3: [1], 4: [13], 10: [4], 0: [9]}

    VT_after_Step11_Que0_Req10.html

    Time of processing all requests 87.015, Time of current queue's turn 87.015
    Step 12Processing queue 0request 11from Node3 (3)to Node9 (9) Remain: 32.965 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 3 to 9 .
  • A new virtual link (3, 9, 0) is created for queue 0 , request 11 , from Node3 to Node9 capacity requirement 32.965 Gbps, having free capacity 7.035 Gbps.
  • New neighbour 9 is appended.
  • New virtual link (3, 9) is appended.
  • Capacities are [7.035]
  • que 0 req 11 (src 3 dst 9 num 0) type New capacity 32.965 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(3,9)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,9,0)[(0,11,32.965,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,9,0)[32.965,7.035,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,11)[(3,9,0,'New',32.965,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10], 8: [9], 1: [2, 6], 3: [1, 9], 4: [13], 10: [4], 0: [9]}

    VT_after_Step12_Que0_Req11.html

    Time of processing all requests 91.964, Time of current queue's turn 91.964
    Step 13Processing queue 0request 12from Node5 (5)to Node11 (11) Remain: 32.886 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 5 to 11 .
  • A new virtual link (5, 11, 0) is created for queue 0 , request 12 , from Node5 to Node11 capacity requirement 32.886 Gbps, having free capacity 7.114 Gbps.
  • New virtual link (5, 11) is appended.
  • Capacities are [7.114]
  • que 0 req 12 (src 5 dst 11 num 0) type New capacity 32.886 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(5,11)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,11,0)[(0,12,32.886,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,11,0)[32.886,7.114,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,12)[(5,11,0,'New',32.886,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10], 8: [9], 1: [2, 6], 3: [1, 9], 4: [13], 10: [4], 0: [9], 5: [11]}

    VT_after_Step13_Que0_Req12.html

    Time of processing all requests 96.782, Time of current queue's turn 96.782
    Step 14Processing queue 0request 13from Node3 (3)to Node8 (8) Remain: 32.882 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 3 to 8 .
  • A new virtual link (3, 8, 0) is created for queue 0 , request 13 , from Node3 to Node8 capacity requirement 32.882 Gbps, having free capacity 7.118 Gbps.
  • New neighbour 8 is appended.
  • New virtual link (3, 8) is appended.
  • Capacities are [7.118]
  • que 0 req 13 (src 3 dst 8 num 0) type New capacity 32.882 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(3,8)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,8,0)[(0,13,32.882,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,8,0)[32.882,7.118,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,13)[(3,8,0,'New',32.882,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10], 8: [9], 1: [2, 6], 3: [1, 9, 8], 4: [13], 10: [4], 0: [9], 5: [11]}

    VT_after_Step14_Que0_Req13.html

    Time of processing all requests 101.803, Time of current queue's turn 1.803
    Step 15Processing queue 0request 14from Node3 (3)to Node10 (10) Remain: 32.53 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 3 to 10 .
  • A new virtual link (3, 10, 0) is created for queue 0 , request 14 , from Node3 to Node10 capacity requirement 32.53 Gbps, having free capacity 7.47 Gbps.
  • New neighbour 10 is appended.
  • New virtual link (3, 10) is appended.
  • Capacities are [7.47]
  • que 0 req 14 (src 3 dst 10 num 0) type New capacity 32.530 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(3,10)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,10,0)[(0,14,32.530,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,10,0)[32.530,7.470,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,14)[(3,10,0,'New',32.530,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10], 8: [9], 1: [2, 6], 3: [1, 9, 8, 10], 4: [13], 10: [4], 0: [9], 5: [11]}

    VT_after_Step15_Que0_Req14.html

    Time of processing all requests 106.797, Time of current queue's turn 6.797
    Step 16Processing queue 0request 15from Node7 (7)to Node3 (3) Remain: 32.28 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 7 to 3 .
  • A new virtual link (7, 3, 0) is created for queue 0 , request 15 , from Node7 to Node3 capacity requirement 32.28 Gbps, having free capacity 7.72 Gbps.
  • New virtual link (7, 3) is appended.
  • Capacities are [7.72]
  • que 0 req 15 (src 7 dst 3 num 0) type New capacity 32.280 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(7,3)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,3,0)[(0,15,32.280,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,3,0)[32.280,7.720,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,15)[(7,3,0,'New',32.280,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10], 8: [9], 1: [2, 6], 3: [1, 9, 8, 10], 4: [13], 10: [4], 0: [9], 5: [11], 7: [3]}

    VT_after_Step16_Que0_Req15.html

    Time of processing all requests 111.837, Time of current queue's turn 11.837
    Step 17Processing queue 0request 16from Node12 (12)to Node8 (8) Remain: 32.124 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 12 to 8 .
  • A new virtual link (12, 8, 0) is created for queue 0 , request 16 , from Node12 to Node8 capacity requirement 32.124 Gbps, having free capacity 7.876 Gbps.
  • New virtual link (12, 8) is appended.
  • Capacities are [7.876]
  • que 0 req 16 (src 12 dst 8 num 0) type New capacity 32.124 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(12,8)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(12,8,0)[(0,16,32.124,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,8,0)[32.124,7.876,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,16)[(12,8,0,'New',32.124,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10], 8: [9], 1: [2, 6], 3: [1, 9, 8, 10], 4: [13], 10: [4], 0: [9], 5: [11], 7: [3], 12: [8]}

    VT_after_Step17_Que0_Req16.html

    Time of processing all requests 117.094, Time of current queue's turn 17.094
    Step 18Processing queue 0request 17from Node8 (8)to Node7 (7) Remain: 32.057 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 8 to 7 .
  • A new virtual link (8, 7, 0) is created for queue 0 , request 17 , from Node8 to Node7 capacity requirement 32.057 Gbps, having free capacity 7.943 Gbps.
  • New neighbour 7 is appended.
  • New virtual link (8, 7) is appended.
  • Capacities are [7.943]
  • que 0 req 17 (src 8 dst 7 num 0) type New capacity 32.057 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(8,7)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,7,0)[(0,17,32.057,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,7,0)[32.057,7.943,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,17)[(8,7,0,'New',32.057,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10], 8: [9, 7], 1: [2, 6], 3: [1, 9, 8, 10], 4: [13], 10: [4], 0: [9], 5: [11], 7: [3], 12: [8]}

    VT_after_Step18_Que0_Req17.html

    Time of processing all requests 121.368, Time of current queue's turn 21.368
    Step 19Processing queue 0request 18from Node11 (11)to Node13 (13) Remain: 31.968 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 11 to 13 .
  • A new virtual link (11, 13, 0) is created for queue 0 , request 18 , from Node11 to Node13 capacity requirement 31.968 Gbps, having free capacity 8.032 Gbps.
  • New neighbour 13 is appended.
  • New virtual link (11, 13) is appended.
  • Capacities are [8.032]
  • que 0 req 18 (src 11 dst 13 num 0) type New capacity 31.968 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(11,13)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,13,0)[(0,18,31.968,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,13,0)[31.968,8.032,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,18)[(11,13,0,'New',31.968,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10, 13], 8: [9, 7], 1: [2, 6], 3: [1, 9, 8, 10], 4: [13], 10: [4], 0: [9], 5: [11], 7: [3], 12: [8]}

    VT_after_Step19_Que0_Req18.html

    Time of processing all requests 126.324, Time of current queue's turn 26.324
    Step 20Processing queue 0request 19from Node6 (6)to Node7 (7) Remain: 31.776 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 6 to 7 .
  • A new virtual link (6, 7, 0) is created for queue 0 , request 19 , from Node6 to Node7 capacity requirement 31.776 Gbps, having free capacity 8.224 Gbps.
  • New virtual link (6, 7) is appended.
  • Capacities are [8.224]
  • que 0 req 19 (src 6 dst 7 num 0) type New capacity 31.776 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(6,7)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,7,0)[(0,19,31.776,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,7,0)[31.776,8.224,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,19)[(6,7,0,'New',31.776,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10, 13], 8: [9, 7], 1: [2, 6], 3: [1, 9, 8, 10], 4: [13], 10: [4], 0: [9], 5: [11], 7: [3], 12: [8], 6: [7]}

    VT_after_Step20_Que0_Req19.html

    Time of processing all requests 130.375, Time of current queue's turn 30.375
    Step 21Processing queue 0request 20from Node5 (5)to Node1 (1) Remain: 31.774 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 5 to 1 .
  • A new virtual link (5, 1, 0) is created for queue 0 , request 20 , from Node5 to Node1 capacity requirement 31.774 Gbps, having free capacity 8.226 Gbps.
  • New neighbour 1 is appended.
  • New virtual link (5, 1) is appended.
  • Capacities are [8.226]
  • que 0 req 20 (src 5 dst 1 num 0) type New capacity 31.774 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(5,1)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,1,0)[(0,20,31.774,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,1,0)[31.774,8.226,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,20)[(5,1,0,'New',31.774,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10, 13], 8: [9, 7], 1: [2, 6], 3: [1, 9, 8, 10], 4: [13], 10: [4], 0: [9], 5: [11, 1], 7: [3], 12: [8], 6: [7]}

    VT_after_Step21_Que0_Req20.html

    Time of processing all requests 134.842, Time of current queue's turn 34.842
    Step 22Processing queue 0request 21from Node6 (6)to Node9 (9) Remain: 31.724 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 6 to 9 .
  • A new virtual link (6, 9, 0) is created for queue 0 , request 21 , from Node6 to Node9 capacity requirement 31.724 Gbps, having free capacity 8.276 Gbps.
  • New neighbour 9 is appended.
  • New virtual link (6, 9) is appended.
  • Capacities are [8.276]
  • que 0 req 21 (src 6 dst 9 num 0) type New capacity 31.724 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(6,9)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,9,0)[(0,21,31.724,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,9,0)[31.724,8.276,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,21)[(6,9,0,'New',31.724,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10, 13], 8: [9, 7], 1: [2, 6], 3: [1, 9, 8, 10], 4: [13], 10: [4], 0: [9], 5: [11, 1], 7: [3], 12: [8], 6: [7, 9]}

    VT_after_Step22_Que0_Req21.html

    Time of processing all requests 140.088, Time of current queue's turn 40.088
    Step 23Processing queue 0request 22from Node10 (10)to Node12 (12) Remain: 31.202 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 10 to 12 .
  • A new virtual link (10, 12, 0) is created for queue 0 , request 22 , from Node10 to Node12 capacity requirement 31.202 Gbps, having free capacity 8.798 Gbps.
  • New neighbour 12 is appended.
  • New virtual link (10, 12) is appended.
  • Capacities are [8.798]
  • que 0 req 22 (src 10 dst 12 num 0) type New capacity 31.202 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(10,12)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,12,0)[(0,22,31.202,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,12,0)[31.202,8.798,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,22)[(10,12,0,'New',31.202,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10, 13], 8: [9, 7], 1: [2, 6], 3: [1, 9, 8, 10], 4: [13], 10: [4, 12], 0: [9], 5: [11, 1], 7: [3], 12: [8], 6: [7, 9]}

    VT_after_Step23_Que0_Req22.html

    Time of processing all requests 144.830, Time of current queue's turn 44.830
    Step 24Processing queue 0request 23from Node5 (5)to Node2 (2) Remain: 31.194 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 5 to 2 .
  • A new virtual link (5, 2, 0) is created for queue 0 , request 23 , from Node5 to Node2 capacity requirement 31.194 Gbps, having free capacity 8.806 Gbps.
  • New neighbour 2 is appended.
  • New virtual link (5, 2) is appended.
  • Capacities are [8.806]
  • que 0 req 23 (src 5 dst 2 num 0) type New capacity 31.194 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(5,2)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,2,0)[(0,23,31.194,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,2,0)[31.194,8.806,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,23)[(5,2,0,'New',31.194,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10, 13], 8: [9, 7], 1: [2, 6], 3: [1, 9, 8, 10], 4: [13], 10: [4, 12], 0: [9], 5: [11, 1, 2], 7: [3], 12: [8], 6: [7, 9]}

    VT_after_Step24_Que0_Req23.html

    Time of processing all requests 148.743, Time of current queue's turn 48.743
    Step 25Processing queue 0request 24from Node2 (2)to Node7 (7) Remain: 30.975 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 2 to 7 .
  • A new virtual link (2, 7, 0) is created for queue 0 , request 24 , from Node2 to Node7 capacity requirement 30.975 Gbps, having free capacity 9.025 Gbps.
  • New virtual link (2, 7) is appended.
  • Capacities are [9.025]
  • que 0 req 24 (src 2 dst 7 num 0) type New capacity 30.975 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(2,7)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,7,0)[(0,24,30.975,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,7,0)[30.975,9.025,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,24)[(2,7,0,'New',30.975,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10, 13], 8: [9, 7], 1: [2, 6], 3: [1, 9, 8, 10], 4: [13], 10: [4, 12], 0: [9], 5: [11, 1, 2], 7: [3], 12: [8], 6: [7, 9], 2: [7]}

    VT_after_Step25_Que0_Req24.html

    Time of processing all requests 153.363, Time of current queue's turn 53.363
    Step 26Processing queue 0request 25from Node10 (10)to Node9 (9) Remain: 30.641 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 10 to 9 .
  • A new virtual link (10, 9, 0) is created for queue 0 , request 25 , from Node10 to Node9 capacity requirement 30.641 Gbps, having free capacity 9.359 Gbps.
  • New neighbour 9 is appended.
  • New virtual link (10, 9) is appended.
  • Capacities are [9.359]
  • que 0 req 25 (src 10 dst 9 num 0) type New capacity 30.641 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(10,9)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,9,0)[(0,25,30.641,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,9,0)[30.641,9.359,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,25)[(10,9,0,'New',30.641,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10, 13], 8: [9, 7], 1: [2, 6], 3: [1, 9, 8, 10], 4: [13], 10: [4, 12, 9], 0: [9], 5: [11, 1, 2], 7: [3], 12: [8], 6: [7, 9], 2: [7]}

    VT_after_Step26_Que0_Req25.html

    Time of processing all requests 158.886, Time of current queue's turn 58.886
    Step 27Processing queue 0request 26from Node1 (1)to Node4 (4) Remain: 30.614 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 1 to 4 .
  • A new virtual link (1, 4, 0) is created for queue 0 , request 26 , from Node1 to Node4 capacity requirement 30.614 Gbps, having free capacity 9.386 Gbps.
  • New neighbour 4 is appended.
  • New virtual link (1, 4) is appended.
  • Capacities are [9.386]
  • que 0 req 26 (src 1 dst 4 num 0) type New capacity 30.614 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(1,4)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(1,4,0)[(0,26,30.614,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,4,0)[30.614,9.386,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,26)[(1,4,0,'New',30.614,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10, 13], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10], 4: [13], 10: [4, 12, 9], 0: [9], 5: [11, 1, 2], 7: [3], 12: [8], 6: [7, 9], 2: [7]}

    VT_after_Step27_Que0_Req26.html

    Time of processing all requests 164.129, Time of current queue's turn 64.129
    Step 28Processing queue 0request 27from Node11 (11)to Node4 (4) Remain: 30.485 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 11 to 4 .
  • A new virtual link (11, 4, 0) is created for queue 0 , request 27 , from Node11 to Node4 capacity requirement 30.485 Gbps, having free capacity 9.515 Gbps.
  • New neighbour 4 is appended.
  • New virtual link (11, 4) is appended.
  • Capacities are [9.515]
  • que 0 req 27 (src 11 dst 4 num 0) type New capacity 30.485 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(11,4)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,4,0)[(0,27,30.485,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,4,0)[30.485,9.515,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,27)[(11,4,0,'New',30.485,0,0)]
    Virtual Topology vT = {13: [10, 1], 11: [2, 10, 13, 4], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10], 4: [13], 10: [4, 12, 9], 0: [9], 5: [11, 1, 2], 7: [3], 12: [8], 6: [7, 9], 2: [7]}

    VT_after_Step28_Que0_Req27.html

    Time of processing all requests 168.323, Time of current queue's turn 68.323
    Step 29Processing queue 0request 28from Node13 (13)to Node12 (12) Remain: 30.433 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 13 to 12 .
  • A new virtual link (13, 12, 0) is created for queue 0 , request 28 , from Node13 to Node12 capacity requirement 30.433 Gbps, having free capacity 9.567 Gbps.
  • New neighbour 12 is appended.
  • New virtual link (13, 12) is appended.
  • Capacities are [9.567]
  • que 0 req 28 (src 13 dst 12 num 0) type New capacity 30.433 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(13,12)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,12,0)[(0,28,30.433,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,12,0)[30.433,9.567,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,28)[(13,12,0,'New',30.433,0,0)]
    Virtual Topology vT = {13: [10, 1, 12], 11: [2, 10, 13, 4], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10], 4: [13], 10: [4, 12, 9], 0: [9], 5: [11, 1, 2], 7: [3], 12: [8], 6: [7, 9], 2: [7]}

    VT_after_Step29_Que0_Req28.html

    Time of processing all requests 173.135, Time of current queue's turn 73.135
    Step 30Processing queue 0request 29from Node5 (5)to Node8 (8) Remain: 30.251 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 5 to 8 .
  • A new virtual link (5, 8, 0) is created for queue 0 , request 29 , from Node5 to Node8 capacity requirement 30.251 Gbps, having free capacity 9.749 Gbps.
  • New neighbour 8 is appended.
  • New virtual link (5, 8) is appended.
  • Capacities are [9.749]
  • que 0 req 29 (src 5 dst 8 num 0) type New capacity 30.251 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(5,8)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,8,0)[(0,29,30.251,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,8,0)[30.251,9.749,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,29)[(5,8,0,'New',30.251,0,0)]
    Virtual Topology vT = {13: [10, 1, 12], 11: [2, 10, 13, 4], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10], 4: [13], 10: [4, 12, 9], 0: [9], 5: [11, 1, 2, 8], 7: [3], 12: [8], 6: [7, 9], 2: [7]}

    VT_after_Step30_Que0_Req29.html

    Time of processing all requests 178.217, Time of current queue's turn 78.217
    Step 31Processing queue 0request 30from Node11 (11)to Node1 (1) Remain: 30.229 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 11 to 1 .
  • A new virtual link (11, 1, 0) is created for queue 0 , request 30 , from Node11 to Node1 capacity requirement 30.229 Gbps, having free capacity 9.771 Gbps.
  • New neighbour 1 is appended.
  • New virtual link (11, 1) is appended.
  • Capacities are [9.771]
  • que 0 req 30 (src 11 dst 1 num 0) type New capacity 30.229 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(11,1)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,1,0)[(0,30,30.229,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,1,0)[30.229,9.771,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,30)[(11,1,0,'New',30.229,0,0)]
    Virtual Topology vT = {13: [10, 1, 12], 11: [2, 10, 13, 4, 1], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10], 4: [13], 10: [4, 12, 9], 0: [9], 5: [11, 1, 2, 8], 7: [3], 12: [8], 6: [7, 9], 2: [7]}

    VT_after_Step31_Que0_Req30.html

    Time of processing all requests 183.395, Time of current queue's turn 83.395
    Step 32Processing queue 0request 31from Node11 (11)to Node7 (7) Remain: 30.07 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 11 to 7 .
  • A new virtual link (11, 7, 0) is created for queue 0 , request 31 , from Node11 to Node7 capacity requirement 30.07 Gbps, having free capacity 9.93 Gbps.
  • New neighbour 7 is appended.
  • New virtual link (11, 7) is appended.
  • Capacities are [9.93]
  • que 0 req 31 (src 11 dst 7 num 0) type New capacity 30.070 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(11,7)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,7,0)[(0,31,30.070,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,7,0)[30.070,9.930,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,31)[(11,7,0,'New',30.070,0,0)]
    Virtual Topology vT = {13: [10, 1, 12], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10], 4: [13], 10: [4, 12, 9], 0: [9], 5: [11, 1, 2, 8], 7: [3], 12: [8], 6: [7, 9], 2: [7]}

    VT_after_Step32_Que0_Req31.html

    Time of processing all requests 188.697, Time of current queue's turn 88.697
    Step 33Processing queue 0request 32from Node9 (9)to Node4 (4) Remain: 30.016 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 9 to 4 .
  • A new virtual link (9, 4, 0) is created for queue 0 , request 32 , from Node9 to Node4 capacity requirement 30.016 Gbps, having free capacity 9.984 Gbps.
  • New virtual link (9, 4) is appended.
  • Capacities are [9.984]
  • que 0 req 32 (src 9 dst 4 num 0) type New capacity 30.016 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(9,4)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,4,0)[(0,32,30.016,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,4,0)[30.016,9.984,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,32)[(9,4,0,'New',30.016,0,0)]
    Virtual Topology vT = {13: [10, 1, 12], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10], 4: [13], 10: [4, 12, 9], 0: [9], 5: [11, 1, 2, 8], 7: [3], 12: [8], 6: [7, 9], 2: [7], 9: [4]}

    VT_after_Step33_Que0_Req32.html

    Time of processing all requests 193.983, Time of current queue's turn 93.983
    Step 34Processing queue 0request 33from Node7 (7)to Node1 (1) Remain: 29.927 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 7 to 1 .
  • A new virtual link (7, 1, 0) is created for queue 0 , request 33 , from Node7 to Node1 capacity requirement 29.927 Gbps, having free capacity 10.073 Gbps.
  • New neighbour 1 is appended.
  • New virtual link (7, 1) is appended.
  • Capacities are [10.073]
  • que 0 req 33 (src 7 dst 1 num 0) type New capacity 29.927 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(7,1)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,1,0)[(0,33,29.927,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,1,0)[29.927,10.073,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,33)[(7,1,0,'New',29.927,0,0)]
    Virtual Topology vT = {13: [10, 1, 12], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10], 4: [13], 10: [4, 12, 9], 0: [9], 5: [11, 1, 2, 8], 7: [3, 1], 12: [8], 6: [7, 9], 2: [7], 9: [4]}

    VT_after_Step34_Que0_Req33.html

    Time of processing all requests 198.624, Time of current queue's turn 98.624
    Step 35Processing queue 0request 34from Node5 (5)to Node7 (7) Remain: 29.913 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 5 to 7 .
  • A new virtual link (5, 7, 0) is created for queue 0 , request 34 , from Node5 to Node7 capacity requirement 29.913 Gbps, having free capacity 10.087 Gbps.
  • New neighbour 7 is appended.
  • New virtual link (5, 7) is appended.
  • Capacities are [10.087]
  • que 0 req 34 (src 5 dst 7 num 0) type New capacity 29.913 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(5,7)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,7,0)[(0,34,29.913,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,7,0)[29.913,10.087,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,34)[(5,7,0,'New',29.913,0,0)]
    Virtual Topology vT = {13: [10, 1, 12], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10], 4: [13], 10: [4, 12, 9], 0: [9], 5: [11, 1, 2, 8, 7], 7: [3, 1], 12: [8], 6: [7, 9], 2: [7], 9: [4]}

    VT_after_Step35_Que0_Req34.html

    Time of processing all requests 202.435, Time of current queue's turn 2.435
    Step 36Processing queue 0request 35from Node6 (6)to Node10 (10) Remain: 29.764 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 6 to 10 .
  • A new virtual link (6, 10, 0) is created for queue 0 , request 35 , from Node6 to Node10 capacity requirement 29.764 Gbps, having free capacity 10.236 Gbps.
  • New neighbour 10 is appended.
  • New virtual link (6, 10) is appended.
  • Capacities are [10.236]
  • que 0 req 35 (src 6 dst 10 num 0) type New capacity 29.764 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(6,10)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,10,0)[(0,35,29.764,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,10,0)[29.764,10.236,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,35)[(6,10,0,'New',29.764,0,0)]
    Virtual Topology vT = {13: [10, 1, 12], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10], 4: [13], 10: [4, 12, 9], 0: [9], 5: [11, 1, 2, 8, 7], 7: [3, 1], 12: [8], 6: [7, 9, 10], 2: [7], 9: [4]}

    VT_after_Step36_Que0_Req35.html

    Time of processing all requests 207.102, Time of current queue's turn 7.102
    Step 37Processing queue 0request 36from Node3 (3)to Node5 (5) Remain: 29.528 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 3 to 5 .
  • A new virtual link (3, 5, 0) is created for queue 0 , request 36 , from Node3 to Node5 capacity requirement 29.528 Gbps, having free capacity 10.472 Gbps.
  • New neighbour 5 is appended.
  • New virtual link (3, 5) is appended.
  • Capacities are [10.472]
  • que 0 req 36 (src 3 dst 5 num 0) type New capacity 29.528 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(3,5)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,5,0)[(0,36,29.528,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,5,0)[29.528,10.472,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,36)[(3,5,0,'New',29.528,0,0)]
    Virtual Topology vT = {13: [10, 1, 12], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13], 10: [4, 12, 9], 0: [9], 5: [11, 1, 2, 8, 7], 7: [3, 1], 12: [8], 6: [7, 9, 10], 2: [7], 9: [4]}

    VT_after_Step37_Que0_Req36.html

    Time of processing all requests 212.567, Time of current queue's turn 12.567
    Step 38Processing queue 0request 37from Node2 (2)to Node4 (4) Remain: 29.213 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 2 to 4 .
  • A new virtual link (2, 4, 0) is created for queue 0 , request 37 , from Node2 to Node4 capacity requirement 29.213 Gbps, having free capacity 10.787 Gbps.
  • New neighbour 4 is appended.
  • New virtual link (2, 4) is appended.
  • Capacities are [10.787]
  • que 0 req 37 (src 2 dst 4 num 0) type New capacity 29.213 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(2,4)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,4,0)[(0,37,29.213,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,4,0)[29.213,10.787,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,37)[(2,4,0,'New',29.213,0,0)]
    Virtual Topology vT = {13: [10, 1, 12], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13], 10: [4, 12, 9], 0: [9], 5: [11, 1, 2, 8, 7], 7: [3, 1], 12: [8], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step38_Que0_Req37.html

    Time of processing all requests 218.194, Time of current queue's turn 18.194
    Step 39Processing queue 0request 38from Node4 (4)to Node11 (11) Remain: 29.158 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 4 to 11 .
  • A new virtual link (4, 11, 0) is created for queue 0 , request 38 , from Node4 to Node11 capacity requirement 29.158 Gbps, having free capacity 10.842 Gbps.
  • New neighbour 11 is appended.
  • New virtual link (4, 11) is appended.
  • Capacities are [10.842]
  • que 0 req 38 (src 4 dst 11 num 0) type New capacity 29.158 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(4,11)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,11,0)[(0,38,29.158,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,11,0)[29.158,10.842,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,38)[(4,11,0,'New',29.158,0,0)]
    Virtual Topology vT = {13: [10, 1, 12], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13, 11], 10: [4, 12, 9], 0: [9], 5: [11, 1, 2, 8, 7], 7: [3, 1], 12: [8], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step39_Que0_Req38.html

    Time of processing all requests 222.875, Time of current queue's turn 22.875
    Step 40Processing queue 0request 39from Node7 (7)to Node9 (9) Remain: 29.005 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 7 to 9 .
  • A new virtual link (7, 9, 0) is created for queue 0 , request 39 , from Node7 to Node9 capacity requirement 29.005 Gbps, having free capacity 10.995 Gbps.
  • New neighbour 9 is appended.
  • New virtual link (7, 9) is appended.
  • Capacities are [10.995]
  • que 0 req 39 (src 7 dst 9 num 0) type New capacity 29.005 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(7,9)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,9,0)[(0,39,29.005,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,9,0)[29.005,10.995,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,39)[(7,9,0,'New',29.005,0,0)]
    Virtual Topology vT = {13: [10, 1, 12], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13, 11], 10: [4, 12, 9], 0: [9], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9], 12: [8], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step40_Que0_Req39.html

    Time of processing all requests 228.558, Time of current queue's turn 28.558
    Step 41Processing queue 0request 40from Node0 (0)to Node1 (1) Remain: 28.978 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 0 to 1 .
  • A new virtual link (0, 1, 0) is created for queue 0 , request 40 , from Node0 to Node1 capacity requirement 28.978 Gbps, having free capacity 11.022 Gbps.
  • New neighbour 1 is appended.
  • New virtual link (0, 1) is appended.
  • Capacities are [11.022]
  • que 0 req 40 (src 0 dst 1 num 0) type New capacity 28.978 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(0,1)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,1,0)[(0,40,28.978,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,1,0)[28.978,11.022,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,40)[(0,1,0,'New',28.978,0,0)]
    Virtual Topology vT = {13: [10, 1, 12], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13, 11], 10: [4, 12, 9], 0: [9, 1], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9], 12: [8], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step41_Que0_Req40.html

    Time of processing all requests 234.001, Time of current queue's turn 34.001
    Step 42Processing queue 0request 41from Node0 (0)to Node8 (8) Remain: 28.849 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 0 to 8 .
  • A new virtual link (0, 8, 0) is created for queue 0 , request 41 , from Node0 to Node8 capacity requirement 28.849 Gbps, having free capacity 11.151 Gbps.
  • New neighbour 8 is appended.
  • New virtual link (0, 8) is appended.
  • Capacities are [11.151]
  • que 0 req 41 (src 0 dst 8 num 0) type New capacity 28.849 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(0,8)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,8,0)[(0,41,28.849,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,8,0)[28.849,11.151,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,41)[(0,8,0,'New',28.849,0,0)]
    Virtual Topology vT = {13: [10, 1, 12], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13, 11], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9], 12: [8], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step42_Que0_Req41.html

    Time of processing all requests 239.359, Time of current queue's turn 39.359
    Step 43Processing queue 0request 42from Node13 (13)to Node3 (3) Remain: 28.847 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 13 to 3 .
  • A new virtual link (13, 3, 0) is created for queue 0 , request 42 , from Node13 to Node3 capacity requirement 28.847 Gbps, having free capacity 11.153 Gbps.
  • New neighbour 3 is appended.
  • New virtual link (13, 3) is appended.
  • Capacities are [11.153]
  • que 0 req 42 (src 13 dst 3 num 0) type New capacity 28.847 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(13,3)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,3,0)[(0,42,28.847,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,3,0)[28.847,11.153,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,42)[(13,3,0,'New',28.847,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13, 11], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9], 12: [8], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step43_Que0_Req42.html

    Time of processing all requests 244.835, Time of current queue's turn 44.835
    Step 44Processing queue 0request 43from Node13 (13)to Node4 (4) Remain: 28.825 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 13 to 4 .
  • A new virtual link (13, 4, 0) is created for queue 0 , request 43 , from Node13 to Node4 capacity requirement 28.825 Gbps, having free capacity 11.175 Gbps.
  • New neighbour 4 is appended.
  • New virtual link (13, 4) is appended.
  • Capacities are [11.175]
  • que 0 req 43 (src 13 dst 4 num 0) type New capacity 28.825 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(13,4)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,4,0)[(0,43,28.825,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,4,0)[28.825,11.175,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,43)[(13,4,0,'New',28.825,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13, 11], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9], 12: [8], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step44_Que0_Req43.html

    Time of processing all requests 250.603, Time of current queue's turn 50.603
    Step 45Processing queue 0request 44from Node13 (13)to Node11 (11) Remain: 28.741 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 13 to 11 .
  • A new virtual link (13, 11, 0) is created for queue 0 , request 44 , from Node13 to Node11 capacity requirement 28.741 Gbps, having free capacity 11.259 Gbps.
  • New neighbour 11 is appended.
  • New virtual link (13, 11) is appended.
  • Capacities are [11.259]
  • que 0 req 44 (src 13 dst 11 num 0) type New capacity 28.741 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(13,11)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,11,0)[(0,44,28.741,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,11,0)[28.741,11.259,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,44)[(13,11,0,'New',28.741,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13, 11], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9], 12: [8], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step45_Que0_Req44.html

    Time of processing all requests 256.480, Time of current queue's turn 56.480
    Step 46Processing queue 0request 45from Node13 (13)to Node0 (0) Remain: 28.603 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 13 to 0 .
  • A new virtual link (13, 0, 0) is created for queue 0 , request 45 , from Node13 to Node0 capacity requirement 28.603 Gbps, having free capacity 11.397 Gbps.
  • New neighbour 0 is appended.
  • New virtual link (13, 0) is appended.
  • Capacities are [11.397]
  • que 0 req 45 (src 13 dst 0 num 0) type New capacity 28.603 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(13,0)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,0,0)[(0,45,28.603,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,0,0)[28.603,11.397,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,45)[(13,0,0,'New',28.603,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13, 11], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9], 12: [8], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step46_Que0_Req45.html

    Time of processing all requests 261.484, Time of current queue's turn 61.484
    Step 47Processing queue 0request 46from Node8 (8)to Node11 (11) Remain: 28.586 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 8 to 11 .
  • A new virtual link (8, 11, 0) is created for queue 0 , request 46 , from Node8 to Node11 capacity requirement 28.586 Gbps, having free capacity 11.414 Gbps.
  • New neighbour 11 is appended.
  • New virtual link (8, 11) is appended.
  • Capacities are [11.414]
  • que 0 req 46 (src 8 dst 11 num 0) type New capacity 28.586 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(8,11)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,11,0)[(0,46,28.586,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,11,0)[28.586,11.414,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,46)[(8,11,0,'New',28.586,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7, 11], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13, 11], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9], 12: [8], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step47_Que0_Req46.html

    Time of processing all requests 266.732, Time of current queue's turn 66.732
    Step 48Processing queue 0request 47from Node4 (4)to Node3 (3) Remain: 28.558 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 4 to 3 .
  • A new virtual link (4, 3, 0) is created for queue 0 , request 47 , from Node4 to Node3 capacity requirement 28.558 Gbps, having free capacity 11.442 Gbps.
  • New neighbour 3 is appended.
  • New virtual link (4, 3) is appended.
  • Capacities are [11.442]
  • que 0 req 47 (src 4 dst 3 num 0) type New capacity 28.558 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(4,3)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,3,0)[(0,47,28.558,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,3,0)[28.558,11.442,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,47)[(4,3,0,'New',28.558,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7, 11], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9], 12: [8], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step48_Que0_Req47.html

    Time of processing all requests 272.228, Time of current queue's turn 72.228
    Step 49Processing queue 0request 48from Node7 (7)to Node12 (12) Remain: 28.555 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 7 to 12 .
  • A new virtual link (7, 12, 0) is created for queue 0 , request 48 , from Node7 to Node12 capacity requirement 28.555 Gbps, having free capacity 11.445 Gbps.
  • New neighbour 12 is appended.
  • New virtual link (7, 12) is appended.
  • Capacities are [11.445]
  • que 0 req 48 (src 7 dst 12 num 0) type New capacity 28.555 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(7,12)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,12,0)[(0,48,28.555,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,12,0)[28.555,11.445,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,48)[(7,12,0,'New',28.555,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7, 11], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9, 12], 12: [8], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step49_Que0_Req48.html

    Time of processing all requests 277.452, Time of current queue's turn 77.452
    Step 50Processing queue 0request 49from Node12 (12)to Node9 (9) Remain: 28.47 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 12 to 9 .
  • A new virtual link (12, 9, 0) is created for queue 0 , request 49 , from Node12 to Node9 capacity requirement 28.47 Gbps, having free capacity 11.53 Gbps.
  • New neighbour 9 is appended.
  • New virtual link (12, 9) is appended.
  • Capacities are [11.53]
  • que 0 req 49 (src 12 dst 9 num 0) type New capacity 28.470 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(12,9)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(12,9,0)[(0,49,28.470,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,9,0)[28.470,11.530,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,49)[(12,9,0,'New',28.470,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7, 11], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9, 12], 12: [8, 9], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step50_Que0_Req49.html

    Time of processing all requests 282.487, Time of current queue's turn 82.487
    Step 51Processing queue 0request 50from Node8 (8)to Node2 (2) Remain: 28.299 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 8 to 2 .
  • A new virtual link (8, 2, 0) is created for queue 0 , request 50 , from Node8 to Node2 capacity requirement 28.299 Gbps, having free capacity 11.701 Gbps.
  • New neighbour 2 is appended.
  • New virtual link (8, 2) is appended.
  • Capacities are [11.701]
  • que 0 req 50 (src 8 dst 2 num 0) type New capacity 28.299 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(8,2)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,2,0)[(0,50,28.299,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,2,0)[28.299,11.701,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,50)[(8,2,0,'New',28.299,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7, 11, 2], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9, 12], 12: [8, 9], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step51_Que0_Req50.html

    Time of processing all requests 287.795, Time of current queue's turn 87.795
    Step 52Processing queue 0request 51from Node4 (4)to Node7 (7) Remain: 28.173 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 4 to 7 .
  • A new virtual link (4, 7, 0) is created for queue 0 , request 51 , from Node4 to Node7 capacity requirement 28.173 Gbps, having free capacity 11.827 Gbps.
  • New neighbour 7 is appended.
  • New virtual link (4, 7) is appended.
  • Capacities are [11.827]
  • que 0 req 51 (src 4 dst 7 num 0) type New capacity 28.173 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(4,7)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,7,0)[(0,51,28.173,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,7,0)[28.173,11.827,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,51)[(4,7,0,'New',28.173,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7, 11, 2], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9, 12], 12: [8, 9], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step52_Que0_Req51.html

    Time of processing all requests 292.616, Time of current queue's turn 92.616
    Step 53Processing queue 0request 52from Node12 (12)to Node13 (13) Remain: 28.126 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 12 to 13 .
  • A new virtual link (12, 13, 0) is created for queue 0 , request 52 , from Node12 to Node13 capacity requirement 28.126 Gbps, having free capacity 11.874 Gbps.
  • New neighbour 13 is appended.
  • New virtual link (12, 13) is appended.
  • Capacities are [11.874]
  • que 0 req 52 (src 12 dst 13 num 0) type New capacity 28.126 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(12,13)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(12,13,0)[(0,52,28.126,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,13,0)[28.126,11.874,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,52)[(12,13,0,'New',28.126,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7, 11, 2], 1: [2, 6, 4], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9, 12], 12: [8, 9, 13], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step53_Que0_Req52.html

    Time of processing all requests 298.012, Time of current queue's turn 98.012
    Step 54Processing queue 0request 53from Node1 (1)to Node7 (7) Remain: 28.089 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 1 to 7 .
  • A new virtual link (1, 7, 0) is created for queue 0 , request 53 , from Node1 to Node7 capacity requirement 28.089 Gbps, having free capacity 11.911 Gbps.
  • New neighbour 7 is appended.
  • New virtual link (1, 7) is appended.
  • Capacities are [11.911]
  • que 0 req 53 (src 1 dst 7 num 0) type New capacity 28.089 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(1,7)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(1,7,0)[(0,53,28.089,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,7,0)[28.089,11.911,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,53)[(1,7,0,'New',28.089,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7, 11, 2], 1: [2, 6, 4, 7], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9, 12], 12: [8, 9, 13], 6: [7, 9, 10], 2: [7, 4], 9: [4]}

    VT_after_Step54_Que0_Req53.html

    Time of processing all requests 303.857, Time of current queue's turn 3.857
    Step 55Processing queue 0request 54from Node9 (9)to Node7 (7) Remain: 27.922 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 9 to 7 .
  • A new virtual link (9, 7, 0) is created for queue 0 , request 54 , from Node9 to Node7 capacity requirement 27.922 Gbps, having free capacity 12.078 Gbps.
  • New neighbour 7 is appended.
  • New virtual link (9, 7) is appended.
  • Capacities are [12.078]
  • que 0 req 54 (src 9 dst 7 num 0) type New capacity 27.922 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(9,7)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,7,0)[(0,54,27.922,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,7,0)[27.922,12.078,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,54)[(9,7,0,'New',27.922,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7, 11, 2], 1: [2, 6, 4, 7], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9, 12], 12: [8, 9, 13], 6: [7, 9, 10], 2: [7, 4], 9: [4, 7]}

    VT_after_Step55_Que0_Req54.html

    Time of processing all requests 309.484, Time of current queue's turn 9.484
    Step 56Processing queue 0request 55from Node1 (1)to Node0 (0) Remain: 27.886 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 1 to 0 .
  • A new virtual link (1, 0, 0) is created for queue 0 , request 55 , from Node1 to Node0 capacity requirement 27.886 Gbps, having free capacity 12.114 Gbps.
  • New neighbour 0 is appended.
  • New virtual link (1, 0) is appended.
  • Capacities are [12.114]
  • que 0 req 55 (src 1 dst 0 num 0) type New capacity 27.886 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(1,0)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(1,0,0)[(0,55,27.886,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,0,0)[27.886,12.114,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,55)[(1,0,0,'New',27.886,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7, 11, 2], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9, 12], 12: [8, 9, 13], 6: [7, 9, 10], 2: [7, 4], 9: [4, 7]}

    VT_after_Step56_Que0_Req55.html

    Time of processing all requests 315.364, Time of current queue's turn 15.364
    Step 57Processing queue 0request 56from Node8 (8)to Node12 (12) Remain: 27.812 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 8 to 12 .
  • A new virtual link (8, 12, 0) is created for queue 0 , request 56 , from Node8 to Node12 capacity requirement 27.812 Gbps, having free capacity 12.188 Gbps.
  • New neighbour 12 is appended.
  • New virtual link (8, 12) is appended.
  • Capacities are [12.188]
  • que 0 req 56 (src 8 dst 12 num 0) type New capacity 27.812 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(8,12)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,12,0)[(0,56,27.812,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,12,0)[27.812,12.188,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,56)[(8,12,0,'New',27.812,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7, 11, 2, 12], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9, 12], 12: [8, 9, 13], 6: [7, 9, 10], 2: [7, 4], 9: [4, 7]}

    VT_after_Step57_Que0_Req56.html

    Time of processing all requests 320.764, Time of current queue's turn 20.764
    Step 58Processing queue 0request 57from Node13 (13)to Node5 (5) Remain: 27.588 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 13 to 5 .
  • A new virtual link (13, 5, 0) is created for queue 0 , request 57 , from Node13 to Node5 capacity requirement 27.588 Gbps, having free capacity 12.412 Gbps.
  • New neighbour 5 is appended.
  • New virtual link (13, 5) is appended.
  • Capacities are [12.412]
  • que 0 req 57 (src 13 dst 5 num 0) type New capacity 27.588 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(13,5)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,5,0)[(0,57,27.588,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,5,0)[27.588,12.412,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,57)[(13,5,0,'New',27.588,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5], 11: [2, 10, 13, 4, 1, 7], 8: [9, 7, 11, 2, 12], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9, 12], 12: [8, 9, 13], 6: [7, 9, 10], 2: [7, 4], 9: [4, 7]}

    VT_after_Step58_Que0_Req57.html

    Time of processing all requests 326.400, Time of current queue's turn 26.400
    Step 59Processing queue 0request 58from Node11 (11)to Node6 (6) Remain: 27.49 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 11 to 6 .
  • A new virtual link (11, 6, 0) is created for queue 0 , request 58 , from Node11 to Node6 capacity requirement 27.49 Gbps, having free capacity 12.51 Gbps.
  • New neighbour 6 is appended.
  • New virtual link (11, 6) is appended.
  • Capacities are [12.51]
  • que 0 req 58 (src 11 dst 6 num 0) type New capacity 27.490 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(11,6)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,6,0)[(0,58,27.490,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,6,0)[27.490,12.510,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,58)[(11,6,0,'New',27.490,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7], 7: [3, 1, 9, 12], 12: [8, 9, 13], 6: [7, 9, 10], 2: [7, 4], 9: [4, 7]}

    VT_after_Step59_Que0_Req58.html

    Time of processing all requests 330.763, Time of current queue's turn 30.763
    Step 60Processing queue 0request 59from Node5 (5)to Node3 (3) Remain: 27.38 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 5 to 3 .
  • A new virtual link (5, 3, 0) is created for queue 0 , request 59 , from Node5 to Node3 capacity requirement 27.38 Gbps, having free capacity 12.62 Gbps.
  • New neighbour 3 is appended.
  • New virtual link (5, 3) is appended.
  • Capacities are [12.62]
  • que 0 req 59 (src 5 dst 3 num 0) type New capacity 27.380 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(5,3)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,3,0)[(0,59,27.380,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,3,0)[27.380,12.620,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,59)[(5,3,0,'New',27.380,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7, 3], 7: [3, 1, 9, 12], 12: [8, 9, 13], 6: [7, 9, 10], 2: [7, 4], 9: [4, 7]}

    VT_after_Step60_Que0_Req59.html

    Time of processing all requests 334.681, Time of current queue's turn 34.681
    Step 61Processing queue 0request 60from Node4 (4)to Node2 (2) Remain: 27.245 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 4 to 2 .
  • A new virtual link (4, 2, 0) is created for queue 0 , request 60 , from Node4 to Node2 capacity requirement 27.245 Gbps, having free capacity 12.755 Gbps.
  • New neighbour 2 is appended.
  • New virtual link (4, 2) is appended.
  • Capacities are [12.755]
  • que 0 req 60 (src 4 dst 2 num 0) type New capacity 27.245 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(4,2)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,2,0)[(0,60,27.245,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,2,0)[27.245,12.755,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,60)[(4,2,0,'New',27.245,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7, 3], 7: [3, 1, 9, 12], 12: [8, 9, 13], 6: [7, 9, 10], 2: [7, 4], 9: [4, 7]}

    VT_after_Step61_Que0_Req60.html

    Time of processing all requests 339.684, Time of current queue's turn 39.684
    Step 62Processing queue 0request 61from Node7 (7)to Node6 (6) Remain: 27.134 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 7 to 6 .
  • A new virtual link (7, 6, 0) is created for queue 0 , request 61 , from Node7 to Node6 capacity requirement 27.134 Gbps, having free capacity 12.866 Gbps.
  • New neighbour 6 is appended.
  • New virtual link (7, 6) is appended.
  • Capacities are [12.866]
  • que 0 req 61 (src 7 dst 6 num 0) type New capacity 27.134 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(7,6)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,6,0)[(0,61,27.134,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,6,0)[27.134,12.866,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,61)[(7,6,0,'New',27.134,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2], 10: [4, 12, 9], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7, 3], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13], 6: [7, 9, 10], 2: [7, 4], 9: [4, 7]}

    VT_after_Step62_Que0_Req61.html

    Time of processing all requests 344.681, Time of current queue's turn 44.681
    Step 63Processing queue 0request 62from Node10 (10)to Node0 (0) Remain: 27.036 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 10 to 0 .
  • A new virtual link (10, 0, 0) is created for queue 0 , request 62 , from Node10 to Node0 capacity requirement 27.036 Gbps, having free capacity 12.964 Gbps.
  • New neighbour 0 is appended.
  • New virtual link (10, 0) is appended.
  • Capacities are [12.964]
  • que 0 req 62 (src 10 dst 0 num 0) type New capacity 27.036 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(10,0)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,0,0)[(0,62,27.036,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,0,0)[27.036,12.964,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,62)[(10,0,0,'New',27.036,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2], 10: [4, 12, 9, 0], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7, 3], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13], 6: [7, 9, 10], 2: [7, 4], 9: [4, 7]}

    VT_after_Step63_Que0_Req62.html

    Time of processing all requests 349.544, Time of current queue's turn 49.544
    Step 64Processing queue 0request 63from Node2 (2)to Node12 (12) Remain: 26.956 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 2 to 12 .
  • A new virtual link (2, 12, 0) is created for queue 0 , request 63 , from Node2 to Node12 capacity requirement 26.956 Gbps, having free capacity 13.044 Gbps.
  • New neighbour 12 is appended.
  • New virtual link (2, 12) is appended.
  • Capacities are [13.044]
  • que 0 req 63 (src 2 dst 12 num 0) type New capacity 26.956 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(2,12)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,12,0)[(0,63,26.956,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,12,0)[26.956,13.044,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,63)[(2,12,0,'New',26.956,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2], 10: [4, 12, 9, 0], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7, 3], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13], 6: [7, 9, 10], 2: [7, 4, 12], 9: [4, 7]}

    VT_after_Step64_Que0_Req63.html

    Time of processing all requests 354.213, Time of current queue's turn 54.213
    Step 65Processing queue 0request 64from Node4 (4)to Node9 (9) Remain: 26.748 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 4 to 9 .
  • A new virtual link (4, 9, 0) is created for queue 0 , request 64 , from Node4 to Node9 capacity requirement 26.748 Gbps, having free capacity 13.252 Gbps.
  • New neighbour 9 is appended.
  • New virtual link (4, 9) is appended.
  • Capacities are [13.252]
  • que 0 req 64 (src 4 dst 9 num 0) type New capacity 26.748 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(4,9)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,9,0)[(0,64,26.748,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,9,0)[26.748,13.252,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,64)[(4,9,0,'New',26.748,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2, 9], 10: [4, 12, 9, 0], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7, 3], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13], 6: [7, 9, 10], 2: [7, 4, 12], 9: [4, 7]}

    VT_after_Step65_Que0_Req64.html

    Time of processing all requests 359.773, Time of current queue's turn 59.773
    Step 66Processing queue 0request 65from Node13 (13)to Node9 (9) Remain: 26.167 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 13 to 9 .
  • A new virtual link (13, 9, 0) is created for queue 0 , request 65 , from Node13 to Node9 capacity requirement 26.167 Gbps, having free capacity 13.833 Gbps.
  • New neighbour 9 is appended.
  • New virtual link (13, 9) is appended.
  • Capacities are [13.833]
  • que 0 req 65 (src 13 dst 9 num 0) type New capacity 26.167 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(13,9)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,9,0)[(0,65,26.167,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,9,0)[26.167,13.833,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,65)[(13,9,0,'New',26.167,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2, 9], 10: [4, 12, 9, 0], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7, 3], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13], 6: [7, 9, 10], 2: [7, 4, 12], 9: [4, 7]}

    VT_after_Step66_Que0_Req65.html

    Time of processing all requests 365.313, Time of current queue's turn 65.313
    Step 67Processing queue 0request 66from Node2 (2)to Node6 (6) Remain: 26.031 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 2 to 6 .
  • A new virtual link (2, 6, 0) is created for queue 0 , request 66 , from Node2 to Node6 capacity requirement 26.031 Gbps, having free capacity 13.969 Gbps.
  • New neighbour 6 is appended.
  • New virtual link (2, 6) is appended.
  • Capacities are [13.969]
  • que 0 req 66 (src 2 dst 6 num 0) type New capacity 26.031 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(2,6)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,6,0)[(0,66,26.031,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,6,0)[26.031,13.969,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,66)[(2,6,0,'New',26.031,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2, 9], 10: [4, 12, 9, 0], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7, 3], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13], 6: [7, 9, 10], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step67_Que0_Req66.html

    Time of processing all requests 370.771, Time of current queue's turn 70.771
    Step 68Processing queue 0request 67from Node5 (5)to Node13 (13) Remain: 25.708 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 5 to 13 .
  • A new virtual link (5, 13, 0) is created for queue 0 , request 67 , from Node5 to Node13 capacity requirement 25.708 Gbps, having free capacity 14.292 Gbps.
  • New neighbour 13 is appended.
  • New virtual link (5, 13) is appended.
  • Capacities are [14.292]
  • que 0 req 67 (src 5 dst 13 num 0) type New capacity 25.708 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(5,13)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,13,0)[(0,67,25.708,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,13,0)[25.708,14.292,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,67)[(5,13,0,'New',25.708,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2, 9], 10: [4, 12, 9, 0], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13], 6: [7, 9, 10], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step68_Que0_Req67.html

    Time of processing all requests 376.178, Time of current queue's turn 76.178
    Step 69Processing queue 0request 68from Node6 (6)to Node4 (4) Remain: 25.6 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 6 to 4 .
  • A new virtual link (6, 4, 0) is created for queue 0 , request 68 , from Node6 to Node4 capacity requirement 25.6 Gbps, having free capacity 14.4 Gbps.
  • New neighbour 4 is appended.
  • New virtual link (6, 4) is appended.
  • Capacities are [14.4]
  • que 0 req 68 (src 6 dst 4 num 0) type New capacity 25.600 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(6,4)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,4,0)[(0,68,25.600,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,4,0)[25.600,14.400,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,68)[(6,4,0,'New',25.600,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2, 9], 10: [4, 12, 9, 0], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13], 6: [7, 9, 10, 4], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step69_Que0_Req68.html

    Time of processing all requests 381.635, Time of current queue's turn 81.635
    Step 70Processing queue 0request 69from Node13 (13)to Node2 (2) Remain: 25.537 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 13 to 2 .
  • A new virtual link (13, 2, 0) is created for queue 0 , request 69 , from Node13 to Node2 capacity requirement 25.537 Gbps, having free capacity 14.463 Gbps.
  • New neighbour 2 is appended.
  • New virtual link (13, 2) is appended.
  • Capacities are [14.463]
  • que 0 req 69 (src 13 dst 2 num 0) type New capacity 25.537 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(13,2)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,2,0)[(0,69,25.537,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,2,0)[25.537,14.463,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,69)[(13,2,0,'New',25.537,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2, 9], 10: [4, 12, 9, 0], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13], 6: [7, 9, 10, 4], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step70_Que0_Req69.html

    Time of processing all requests 387.298, Time of current queue's turn 87.298
    Step 71Processing queue 0request 70from Node8 (8)to Node5 (5) Remain: 25.481 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 8 to 5 .
  • A new virtual link (8, 5, 0) is created for queue 0 , request 70 , from Node8 to Node5 capacity requirement 25.481 Gbps, having free capacity 14.519 Gbps.
  • New neighbour 5 is appended.
  • New virtual link (8, 5) is appended.
  • Capacities are [14.519]
  • que 0 req 70 (src 8 dst 5 num 0) type New capacity 25.481 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(8,5)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,5,0)[(0,70,25.481,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,5,0)[25.481,14.519,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,70)[(8,5,0,'New',25.481,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2, 9], 10: [4, 12, 9, 0], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13], 6: [7, 9, 10, 4], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step71_Que0_Req70.html

    Time of processing all requests 393.558, Time of current queue's turn 93.558
    Step 72Processing queue 0request 71from Node12 (12)to Node0 (0) Remain: 25.44 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 12 to 0 .
  • A new virtual link (12, 0, 0) is created for queue 0 , request 71 , from Node12 to Node0 capacity requirement 25.44 Gbps, having free capacity 14.56 Gbps.
  • New neighbour 0 is appended.
  • New virtual link (12, 0) is appended.
  • Capacities are [14.56]
  • que 0 req 71 (src 12 dst 0 num 0) type New capacity 25.440 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(12,0)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(12,0,0)[(0,71,25.440,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,0,0)[25.440,14.560,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,71)[(12,0,0,'New',25.440,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2, 9], 10: [4, 12, 9, 0], 0: [9, 1, 8], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0], 6: [7, 9, 10, 4], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step72_Que0_Req71.html

    Time of processing all requests 398.508, Time of current queue's turn 98.508
    Step 73Processing queue 0request 72from Node0 (0)to Node7 (7) Remain: 25.417 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 0 to 7 .
  • A new virtual link (0, 7, 0) is created for queue 0 , request 72 , from Node0 to Node7 capacity requirement 25.417 Gbps, having free capacity 14.583 Gbps.
  • New neighbour 7 is appended.
  • New virtual link (0, 7) is appended.
  • Capacities are [14.583]
  • que 0 req 72 (src 0 dst 7 num 0) type New capacity 25.417 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(0,7)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,7,0)[(0,72,25.417,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,7,0)[25.417,14.583,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,72)[(0,7,0,'New',25.417,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2, 9], 10: [4, 12, 9, 0], 0: [9, 1, 8, 7], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0], 6: [7, 9, 10, 4], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step73_Que0_Req72.html

    Time of processing all requests 402.623, Time of current queue's turn 2.623
    Step 74Processing queue 0request 73from Node13 (13)to Node8 (8) Remain: 25.215 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 13 to 8 .
  • A new virtual link (13, 8, 0) is created for queue 0 , request 73 , from Node13 to Node8 capacity requirement 25.215 Gbps, having free capacity 14.785 Gbps.
  • New neighbour 8 is appended.
  • New virtual link (13, 8) is appended.
  • Capacities are [14.785]
  • que 0 req 73 (src 13 dst 8 num 0) type New capacity 25.215 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(13,8)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,8,0)[(0,73,25.215,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,8,0)[25.215,14.785,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,73)[(13,8,0,'New',25.215,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2, 9], 10: [4, 12, 9, 0], 0: [9, 1, 8, 7], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0], 6: [7, 9, 10, 4], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step74_Que0_Req73.html

    Time of processing all requests 407.744, Time of current queue's turn 7.744
    Step 75Processing queue 0request 74from Node13 (13)to Node6 (6) Remain: 24.98 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 13 to 6 .
  • A new virtual link (13, 6, 0) is created for queue 0 , request 74 , from Node13 to Node6 capacity requirement 24.98 Gbps, having free capacity 15.02 Gbps.
  • New neighbour 6 is appended.
  • New virtual link (13, 6) is appended.
  • Capacities are [15.02]
  • que 0 req 74 (src 13 dst 6 num 0) type New capacity 24.980 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(13,6)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,6,0)[(0,74,24.980,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,6,0)[24.980,15.020,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,74)[(13,6,0,'New',24.980,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2, 9], 10: [4, 12, 9, 0], 0: [9, 1, 8, 7], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0], 6: [7, 9, 10, 4], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step75_Que0_Req74.html

    Time of processing all requests 413.807, Time of current queue's turn 13.807
    Step 76Processing queue 0request 75from Node10 (10)to Node8 (8) Remain: 24.855 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 10 to 8 .
  • A new virtual link (10, 8, 0) is created for queue 0 , request 75 , from Node10 to Node8 capacity requirement 24.855 Gbps, having free capacity 15.145 Gbps.
  • New neighbour 8 is appended.
  • New virtual link (10, 8) is appended.
  • Capacities are [15.145]
  • que 0 req 75 (src 10 dst 8 num 0) type New capacity 24.855 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(10,8)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,8,0)[(0,75,24.855,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,8,0)[24.855,15.145,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,75)[(10,8,0,'New',24.855,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2, 9], 10: [4, 12, 9, 0, 8], 0: [9, 1, 8, 7], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0], 6: [7, 9, 10, 4], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step76_Que0_Req75.html

    Time of processing all requests 418.963, Time of current queue's turn 18.963
    Step 77Processing queue 0request 76from Node10 (10)to Node2 (2) Remain: 24.743 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 10 to 2 .
  • A new virtual link (10, 2, 0) is created for queue 0 , request 76 , from Node10 to Node2 capacity requirement 24.743 Gbps, having free capacity 15.257 Gbps.
  • New neighbour 2 is appended.
  • New virtual link (10, 2) is appended.
  • Capacities are [15.257]
  • que 0 req 76 (src 10 dst 2 num 0) type New capacity 24.743 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(10,2)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,2,0)[(0,76,24.743,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,2,0)[24.743,15.257,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,76)[(10,2,0,'New',24.743,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2, 9], 10: [4, 12, 9, 0, 8, 2], 0: [9, 1, 8, 7], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0], 6: [7, 9, 10, 4], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step77_Que0_Req76.html

    Time of processing all requests 424.742, Time of current queue's turn 24.742
    Step 78Processing queue 0request 77from Node0 (0)to Node13 (13) Remain: 24.583 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 0 to 13 .
  • A new virtual link (0, 13, 0) is created for queue 0 , request 77 , from Node0 to Node13 capacity requirement 24.583 Gbps, having free capacity 15.417 Gbps.
  • New neighbour 13 is appended.
  • New virtual link (0, 13) is appended.
  • Capacities are [15.417]
  • que 0 req 77 (src 0 dst 13 num 0) type New capacity 24.583 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(0,13)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,13,0)[(0,77,24.583,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,13,0)[24.583,15.417,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,77)[(0,13,0,'New',24.583,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5], 4: [13, 11, 3, 7, 2, 9], 10: [4, 12, 9, 0, 8, 2], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0], 6: [7, 9, 10, 4], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step78_Que0_Req77.html

    Time of processing all requests 430.981, Time of current queue's turn 30.981
    Step 79Processing queue 0request 78from Node3 (3)to Node12 (12) Remain: 24.472 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 3 to 12 .
  • A new virtual link (3, 12, 0) is created for queue 0 , request 78 , from Node3 to Node12 capacity requirement 24.472 Gbps, having free capacity 15.528 Gbps.
  • New neighbour 12 is appended.
  • New virtual link (3, 12) is appended.
  • Capacities are [15.528]
  • que 0 req 78 (src 3 dst 12 num 0) type New capacity 24.472 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(3,12)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,12,0)[(0,78,24.472,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,12,0)[24.472,15.528,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,78)[(3,12,0,'New',24.472,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9], 10: [4, 12, 9, 0, 8, 2], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0], 6: [7, 9, 10, 4], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step79_Que0_Req78.html

    Time of processing all requests 436.100, Time of current queue's turn 36.100
    Step 80Processing queue 0request 79from Node4 (4)to Node6 (6) Remain: 24.465 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 4 to 6 .
  • A new virtual link (4, 6, 0) is created for queue 0 , request 79 , from Node4 to Node6 capacity requirement 24.465 Gbps, having free capacity 15.535 Gbps.
  • New neighbour 6 is appended.
  • New virtual link (4, 6) is appended.
  • Capacities are [15.535]
  • que 0 req 79 (src 4 dst 6 num 0) type New capacity 24.465 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(4,6)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,6,0)[(0,79,24.465,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,6,0)[24.465,15.535,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,79)[(4,6,0,'New',24.465,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9, 6], 10: [4, 12, 9, 0, 8, 2], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0], 6: [7, 9, 10, 4], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step80_Que0_Req79.html

    Time of processing all requests 442.069, Time of current queue's turn 42.069
    Step 81Processing queue 0request 80from Node10 (10)to Node13 (13) Remain: 24.043 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 10 to 13 .
  • A new virtual link (10, 13, 0) is created for queue 0 , request 80 , from Node10 to Node13 capacity requirement 24.043 Gbps, having free capacity 15.957 Gbps.
  • New neighbour 13 is appended.
  • New virtual link (10, 13) is appended.
  • Capacities are [15.957]
  • que 0 req 80 (src 10 dst 13 num 0) type New capacity 24.043 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(10,13)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,13,0)[(0,80,24.043,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,13,0)[24.043,15.957,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,80)[(10,13,0,'New',24.043,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9, 6], 10: [4, 12, 9, 0, 8, 2, 13], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0], 6: [7, 9, 10, 4], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step81_Que0_Req80.html

    Time of processing all requests 446.722, Time of current queue's turn 46.722
    Step 82Processing queue 0request 81from Node6 (6)to Node13 (13) Remain: 24.006 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 6 to 13 .
  • A new virtual link (6, 13, 0) is created for queue 0 , request 81 , from Node6 to Node13 capacity requirement 24.006 Gbps, having free capacity 15.994 Gbps.
  • New neighbour 13 is appended.
  • New virtual link (6, 13) is appended.
  • Capacities are [15.994]
  • que 0 req 81 (src 6 dst 13 num 0) type New capacity 24.006 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(6,13)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,13,0)[(0,81,24.006,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,13,0)[24.006,15.994,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,81)[(6,13,0,'New',24.006,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9, 6], 10: [4, 12, 9, 0, 8, 2, 13], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0], 6: [7, 9, 10, 4, 13], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step82_Que0_Req81.html

    Time of processing all requests 450.308, Time of current queue's turn 50.308
    Step 83Processing queue 0request 82from Node6 (6)to Node3 (3) Remain: 23.828 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 6 to 3 .
  • A new virtual link (6, 3, 0) is created for queue 0 , request 82 , from Node6 to Node3 capacity requirement 23.828 Gbps, having free capacity 16.172 Gbps.
  • New neighbour 3 is appended.
  • New virtual link (6, 3) is appended.
  • Capacities are [16.172]
  • que 0 req 82 (src 6 dst 3 num 0) type New capacity 23.828 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(6,3)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,3,0)[(0,82,23.828,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,3,0)[23.828,16.172,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,82)[(6,3,0,'New',23.828,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9, 6], 10: [4, 12, 9, 0, 8, 2, 13], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0], 6: [7, 9, 10, 4, 13, 3], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step83_Que0_Req82.html

    Time of processing all requests 455.612, Time of current queue's turn 55.612
    Step 84Processing queue 0request 83from Node10 (10)to Node11 (11) Remain: 23.731 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 10 to 11 .
  • A new virtual link (10, 11, 0) is created for queue 0 , request 83 , from Node10 to Node11 capacity requirement 23.731 Gbps, having free capacity 16.269 Gbps.
  • New neighbour 11 is appended.
  • New virtual link (10, 11) is appended.
  • Capacities are [16.269]
  • que 0 req 83 (src 10 dst 11 num 0) type New capacity 23.731 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(10,11)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,11,0)[(0,83,23.731,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,11,0)[23.731,16.269,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,83)[(10,11,0,'New',23.731,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9, 6], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0], 6: [7, 9, 10, 4, 13, 3], 2: [7, 4, 12, 6], 9: [4, 7]}

    VT_after_Step84_Que0_Req83.html

    Time of processing all requests 461.619, Time of current queue's turn 61.619
    Step 85Processing queue 0request 84from Node2 (2)to Node3 (3) Remain: 23.637 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 2 to 3 .
  • A new virtual link (2, 3, 0) is created for queue 0 , request 84 , from Node2 to Node3 capacity requirement 23.637 Gbps, having free capacity 16.363 Gbps.
  • New neighbour 3 is appended.
  • New virtual link (2, 3) is appended.
  • Capacities are [16.363]
  • que 0 req 84 (src 2 dst 3 num 0) type New capacity 23.637 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(2,3)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,3,0)[(0,84,23.637,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,3,0)[23.637,16.363,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,84)[(2,3,0,'New',23.637,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9, 6], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0], 6: [7, 9, 10, 4, 13, 3], 2: [7, 4, 12, 6, 3], 9: [4, 7]}

    VT_after_Step85_Que0_Req84.html

    Time of processing all requests 467.274, Time of current queue's turn 67.274
    Step 86Processing queue 0request 85from Node12 (12)to Node10 (10) Remain: 23.49 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 12 to 10 .
  • A new virtual link (12, 10, 0) is created for queue 0 , request 85 , from Node12 to Node10 capacity requirement 23.49 Gbps, having free capacity 16.51 Gbps.
  • New neighbour 10 is appended.
  • New virtual link (12, 10) is appended.
  • Capacities are [16.51]
  • que 0 req 85 (src 12 dst 10 num 0) type New capacity 23.490 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(12,10)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(12,10,0)[(0,85,23.490,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,10,0)[23.490,16.510,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,85)[(12,10,0,'New',23.490,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9, 6], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0, 10], 6: [7, 9, 10, 4, 13, 3], 2: [7, 4, 12, 6, 3], 9: [4, 7]}

    VT_after_Step86_Que0_Req85.html

    Time of processing all requests 473.742, Time of current queue's turn 73.742
    Step 87Processing queue 0request 86from Node11 (11)to Node12 (12) Remain: 23.372 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 11 to 12 .
  • A new virtual link (11, 12, 0) is created for queue 0 , request 86 , from Node11 to Node12 capacity requirement 23.372 Gbps, having free capacity 16.628 Gbps.
  • New neighbour 12 is appended.
  • New virtual link (11, 12) is appended.
  • Capacities are [16.628]
  • que 0 req 86 (src 11 dst 12 num 0) type New capacity 23.372 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(11,12)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,12,0)[(0,86,23.372,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,12,0)[23.372,16.628,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,86)[(11,12,0,'New',23.372,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9, 6], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0, 10], 6: [7, 9, 10, 4, 13, 3], 2: [7, 4, 12, 6, 3], 9: [4, 7]}

    VT_after_Step87_Que0_Req86.html

    Time of processing all requests 480.082, Time of current queue's turn 80.082
    Step 88Processing queue 0request 87from Node2 (2)to Node11 (11) Remain: 23.368 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 2 to 11 .
  • A new virtual link (2, 11, 0) is created for queue 0 , request 87 , from Node2 to Node11 capacity requirement 23.368 Gbps, having free capacity 16.632 Gbps.
  • New neighbour 11 is appended.
  • New virtual link (2, 11) is appended.
  • Capacities are [16.632]
  • que 0 req 87 (src 2 dst 11 num 0) type New capacity 23.368 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(2,11)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,11,0)[(0,87,23.368,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,11,0)[23.368,16.632,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,87)[(2,11,0,'New',23.368,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9, 6], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0, 10], 6: [7, 9, 10, 4, 13, 3], 2: [7, 4, 12, 6, 3, 11], 9: [4, 7]}

    VT_after_Step88_Que0_Req87.html

    Time of processing all requests 486.640, Time of current queue's turn 86.640
    Step 89Processing queue 0request 88from Node5 (5)to Node12 (12) Remain: 23.113 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 5 to 12 .
  • A new virtual link (5, 12, 0) is created for queue 0 , request 88 , from Node5 to Node12 capacity requirement 23.113 Gbps, having free capacity 16.887 Gbps.
  • New neighbour 12 is appended.
  • New virtual link (5, 12) is appended.
  • Capacities are [16.887]
  • que 0 req 88 (src 5 dst 12 num 0) type New capacity 23.113 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(5,12)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,12,0)[(0,88,23.113,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,12,0)[23.113,16.887,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,88)[(5,12,0,'New',23.113,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9, 6], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13, 12], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0, 10], 6: [7, 9, 10, 4, 13, 3], 2: [7, 4, 12, 6, 3, 11], 9: [4, 7]}

    VT_after_Step89_Que0_Req88.html

    Time of processing all requests 492.869, Time of current queue's turn 92.869
    Step 90Processing queue 0request 89from Node4 (4)to Node10 (10) Remain: 23.098 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 4 to 10 .
  • A new virtual link (4, 10, 0) is created for queue 0 , request 89 , from Node4 to Node10 capacity requirement 23.098 Gbps, having free capacity 16.902 Gbps.
  • New neighbour 10 is appended.
  • New virtual link (4, 10) is appended.
  • Capacities are [16.902]
  • que 0 req 89 (src 4 dst 10 num 0) type New capacity 23.098 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(4,10)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,10,0)[(0,89,23.098,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,10,0)[23.098,16.902,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,89)[(4,10,0,'New',23.098,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9, 6, 10], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13, 12], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0, 10], 6: [7, 9, 10, 4, 13, 3], 2: [7, 4, 12, 6, 3, 11], 9: [4, 7]}

    VT_after_Step90_Que0_Req89.html

    Time of processing all requests 499.269, Time of current queue's turn 99.269
    Step 91Processing queue 0request 90from Node11 (11)to Node5 (5) Remain: 22.355 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 11 to 5 .
  • A new virtual link (11, 5, 0) is created for queue 0 , request 90 , from Node11 to Node5 capacity requirement 22.355 Gbps, having free capacity 17.645 Gbps.
  • New neighbour 5 is appended.
  • New virtual link (11, 5) is appended.
  • Capacities are [17.645]
  • que 0 req 90 (src 11 dst 5 num 0) type New capacity 22.355 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(11,5)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,5,0)[(0,90,22.355,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,5,0)[22.355,17.645,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,90)[(11,5,0,'New',22.355,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9, 6, 10], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13, 12], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0, 10], 6: [7, 9, 10, 4, 13, 3], 2: [7, 4, 12, 6, 3, 11], 9: [4, 7]}

    VT_after_Step91_Que0_Req90.html

    Time of processing all requests 505.487, Time of current queue's turn 5.487
    Step 92Processing queue 0request 91from Node12 (12)to Node3 (3) Remain: 22.353 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 12 to 3 .
  • A new virtual link (12, 3, 0) is created for queue 0 , request 91 , from Node12 to Node3 capacity requirement 22.353 Gbps, having free capacity 17.647 Gbps.
  • New neighbour 3 is appended.
  • New virtual link (12, 3) is appended.
  • Capacities are [17.647]
  • que 0 req 91 (src 12 dst 3 num 0) type New capacity 22.353 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(12,3)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(12,3,0)[(0,91,22.353,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,3,0)[22.353,17.647,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,91)[(12,3,0,'New',22.353,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9, 6, 10], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13, 12], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3], 2: [7, 4, 12, 6, 3, 11], 9: [4, 7]}

    VT_after_Step92_Que0_Req91.html

    Time of processing all requests 511.526, Time of current queue's turn 11.526
    Step 93Processing queue 0request 92from Node6 (6)to Node8 (8) Remain: 22.101 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 6 to 8 .
  • A new virtual link (6, 8, 0) is created for queue 0 , request 92 , from Node6 to Node8 capacity requirement 22.101 Gbps, having free capacity 17.899 Gbps.
  • New neighbour 8 is appended.
  • New virtual link (6, 8) is appended.
  • Capacities are [17.899]
  • que 0 req 92 (src 6 dst 8 num 0) type New capacity 22.101 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(6,8)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,8,0)[(0,92,22.101,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,8,0)[22.101,17.899,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,92)[(6,8,0,'New',22.101,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9, 6, 10], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13, 12], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11], 9: [4, 7]}

    VT_after_Step93_Que0_Req92.html

    Time of processing all requests 518.080, Time of current queue's turn 18.080
    Step 94Processing queue 0request 93from Node8 (8)to Node4 (4) Remain: 22.069 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 8 to 4 .
  • A new virtual link (8, 4, 0) is created for queue 0 , request 93 , from Node8 to Node4 capacity requirement 22.069 Gbps, having free capacity 17.931 Gbps.
  • New neighbour 4 is appended.
  • New virtual link (8, 4) is appended.
  • Capacities are [17.931]
  • que 0 req 93 (src 8 dst 4 num 0) type New capacity 22.069 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(8,4)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,4,0)[(0,93,22.069,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,4,0)[22.069,17.931,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,93)[(8,4,0,'New',22.069,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9, 6, 10], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13, 12], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11], 9: [4, 7]}

    VT_after_Step94_Que0_Req93.html

    Time of processing all requests 524.119, Time of current queue's turn 24.119
    Step 95Processing queue 0request 94from Node9 (9)to Node3 (3) Remain: 21.812 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 9 to 3 .
  • A new virtual link (9, 3, 0) is created for queue 0 , request 94 , from Node9 to Node3 capacity requirement 21.812 Gbps, having free capacity 18.188 Gbps.
  • New neighbour 3 is appended.
  • New virtual link (9, 3) is appended.
  • Capacities are [18.188]
  • que 0 req 94 (src 9 dst 3 num 0) type New capacity 21.812 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(9,3)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,3,0)[(0,94,21.812,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,3,0)[21.812,18.188,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,94)[(9,3,0,'New',21.812,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12], 4: [13, 11, 3, 7, 2, 9, 6, 10], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13, 12], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11], 9: [4, 7, 3]}

    VT_after_Step95_Que0_Req94.html

    Time of processing all requests 530.650, Time of current queue's turn 30.650
    Step 96Processing queue 0request 95from Node3 (3)to Node13 (13) Remain: 21.778 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 3 to 13 .
  • A new virtual link (3, 13, 0) is created for queue 0 , request 95 , from Node3 to Node13 capacity requirement 21.778 Gbps, having free capacity 18.222 Gbps.
  • New neighbour 13 is appended.
  • New virtual link (3, 13) is appended.
  • Capacities are [18.222]
  • que 0 req 95 (src 3 dst 13 num 0) type New capacity 21.778 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(3,13)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,13,0)[(0,95,21.778,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,13,0)[21.778,18.222,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,95)[(3,13,0,'New',21.778,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12, 13], 4: [13, 11, 3, 7, 2, 9, 6, 10], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13], 5: [11, 1, 2, 8, 7, 3, 13, 12], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11], 9: [4, 7, 3]}

    VT_after_Step96_Que0_Req95.html

    Time of processing all requests 535.731, Time of current queue's turn 35.731
    Step 97Processing queue 0request 96from Node0 (0)to Node6 (6) Remain: 21.474 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 0 to 6 .
  • A new virtual link (0, 6, 0) is created for queue 0 , request 96 , from Node0 to Node6 capacity requirement 21.474 Gbps, having free capacity 18.526 Gbps.
  • New neighbour 6 is appended.
  • New virtual link (0, 6) is appended.
  • Capacities are [18.526]
  • que 0 req 96 (src 0 dst 6 num 0) type New capacity 21.474 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(0,6)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,6,0)[(0,96,21.474,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,6,0)[21.474,18.526,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,96)[(0,6,0,'New',21.474,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12, 13], 4: [13, 11, 3, 7, 2, 9, 6, 10], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6], 5: [11, 1, 2, 8, 7, 3, 13, 12], 7: [3, 1, 9, 12, 6], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11], 9: [4, 7, 3]}

    VT_after_Step97_Que0_Req96.html

    Time of processing all requests 541.478, Time of current queue's turn 41.478
    Step 98Processing queue 0request 97from Node7 (7)to Node2 (2) Remain: 21.425 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 7 to 2 .
  • A new virtual link (7, 2, 0) is created for queue 0 , request 97 , from Node7 to Node2 capacity requirement 21.425 Gbps, having free capacity 18.575 Gbps.
  • New neighbour 2 is appended.
  • New virtual link (7, 2) is appended.
  • Capacities are [18.575]
  • que 0 req 97 (src 7 dst 2 num 0) type New capacity 21.425 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(7,2)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,2,0)[(0,97,21.425,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,2,0)[21.425,18.575,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,97)[(7,2,0,'New',21.425,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12, 13], 4: [13, 11, 3, 7, 2, 9, 6, 10], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6], 5: [11, 1, 2, 8, 7, 3, 13, 12], 7: [3, 1, 9, 12, 6, 2], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11], 9: [4, 7, 3]}

    VT_after_Step98_Que0_Req97.html

    Time of processing all requests 548.101, Time of current queue's turn 48.101
    Step 99Processing queue 0request 98from Node2 (2)to Node13 (13) Remain: 21.262 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 2 to 13 .
  • A new virtual link (2, 13, 0) is created for queue 0 , request 98 , from Node2 to Node13 capacity requirement 21.262 Gbps, having free capacity 18.738 Gbps.
  • New neighbour 13 is appended.
  • New virtual link (2, 13) is appended.
  • Capacities are [18.738]
  • que 0 req 98 (src 2 dst 13 num 0) type New capacity 21.262 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(2,13)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,13,0)[(0,98,21.262,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,13,0)[21.262,18.738,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,98)[(2,13,0,'New',21.262,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12, 13], 4: [13, 11, 3, 7, 2, 9, 6, 10], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6], 5: [11, 1, 2, 8, 7, 3, 13, 12], 7: [3, 1, 9, 12, 6, 2], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11, 13], 9: [4, 7, 3]}

    VT_after_Step99_Que0_Req98.html

    Time of processing all requests 554.425, Time of current queue's turn 54.425
    Step 100Processing queue 0request 99from Node7 (7)to Node5 (5) Remain: 21.239 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 7 to 5 .
  • A new virtual link (7, 5, 0) is created for queue 0 , request 99 , from Node7 to Node5 capacity requirement 21.239 Gbps, having free capacity 18.761 Gbps.
  • New neighbour 5 is appended.
  • New virtual link (7, 5) is appended.
  • Capacities are [18.761]
  • que 0 req 99 (src 7 dst 5 num 0) type New capacity 21.239 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(7,5)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,5,0)[(0,99,21.239,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,5,0)[21.239,18.761,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,99)[(7,5,0,'New',21.239,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12, 13], 4: [13, 11, 3, 7, 2, 9, 6, 10], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6], 5: [11, 1, 2, 8, 7, 3, 13, 12], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11, 13], 9: [4, 7, 3]}

    VT_after_Step100_Que0_Req99.html

    Time of processing all requests 560.655, Time of current queue's turn 60.655
    Step 101Processing queue 0request 100from Node0 (0)to Node10 (10) Remain: 21.126 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 0 to 10 .
  • A new virtual link (0, 10, 0) is created for queue 0 , request 100 , from Node0 to Node10 capacity requirement 21.126 Gbps, having free capacity 18.874 Gbps.
  • New neighbour 10 is appended.
  • New virtual link (0, 10) is appended.
  • Capacities are [18.874]
  • que 0 req 100 (src 0 dst 10 num 0) type New capacity 21.126 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(0,10)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,10,0)[(0,100,21.126,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,10,0)[21.126,18.874,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,100)[(0,10,0,'New',21.126,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12, 13], 4: [13, 11, 3, 7, 2, 9, 6, 10], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11, 13], 9: [4, 7, 3]}

    VT_after_Step101_Que0_Req100.html

    Time of processing all requests 567.101, Time of current queue's turn 67.101
    Step 102Processing queue 0request 101from Node5 (5)to Node10 (10) Remain: 21.096 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 5 to 10 .
  • A new virtual link (5, 10, 0) is created for queue 0 , request 101 , from Node5 to Node10 capacity requirement 21.096 Gbps, having free capacity 18.904 Gbps.
  • New neighbour 10 is appended.
  • New virtual link (5, 10) is appended.
  • Capacities are [18.904]
  • que 0 req 101 (src 5 dst 10 num 0) type New capacity 21.096 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(5,10)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,10,0)[(0,101,21.096,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,10,0)[21.096,18.904,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,101)[(5,10,0,'New',21.096,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12, 13], 4: [13, 11, 3, 7, 2, 9, 6, 10], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11, 13], 9: [4, 7, 3]}

    VT_after_Step102_Que0_Req101.html

    Time of processing all requests 573.480, Time of current queue's turn 73.480
    Step 103Processing queue 0request 102from Node5 (5)to Node0 (0) Remain: 21.052 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 5 to 0 .
  • A new virtual link (5, 0, 0) is created for queue 0 , request 102 , from Node5 to Node0 capacity requirement 21.052 Gbps, having free capacity 18.948 Gbps.
  • New neighbour 0 is appended.
  • New virtual link (5, 0) is appended.
  • Capacities are [18.948]
  • que 0 req 102 (src 5 dst 0 num 0) type New capacity 21.052 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(5,0)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,0,0)[(0,102,21.052,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,0,0)[21.052,18.948,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,102)[(5,0,0,'New',21.052,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12, 13], 4: [13, 11, 3, 7, 2, 9, 6, 10], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11, 13], 9: [4, 7, 3]}

    VT_after_Step103_Que0_Req102.html

    Time of processing all requests 579.565, Time of current queue's turn 79.565
    Step 104Processing queue 0request 103from Node3 (3)to Node4 (4) Remain: 20.666 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 3 to 4 .
  • A new virtual link (3, 4, 0) is created for queue 0 , request 103 , from Node3 to Node4 capacity requirement 20.666 Gbps, having free capacity 19.334 Gbps.
  • New neighbour 4 is appended.
  • New virtual link (3, 4) is appended.
  • Capacities are [19.334]
  • que 0 req 103 (src 3 dst 4 num 0) type New capacity 20.666 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(3,4)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,4,0)[(0,103,20.666,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,4,0)[20.666,19.334,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,103)[(3,4,0,'New',20.666,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11, 13], 9: [4, 7, 3]}

    VT_after_Step104_Que0_Req103.html

    Time of processing all requests 585.818, Time of current queue's turn 85.818
    Step 105Processing queue 0request 104from Node9 (9)to Node10 (10) Remain: 20.662 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 9 to 10 .
  • A new virtual link (9, 10, 0) is created for queue 0 , request 104 , from Node9 to Node10 capacity requirement 20.662 Gbps, having free capacity 19.338 Gbps.
  • New neighbour 10 is appended.
  • New virtual link (9, 10) is appended.
  • Capacities are [19.338]
  • que 0 req 104 (src 9 dst 10 num 0) type New capacity 20.662 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(9,10)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,10,0)[(0,104,20.662,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,10,0)[20.662,19.338,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,104)[(9,10,0,'New',20.662,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11, 13], 9: [4, 7, 3, 10]}

    VT_after_Step105_Que0_Req104.html

    Time of processing all requests 592.157, Time of current queue's turn 92.157
    Step 106Processing queue 0request 105from Node4 (4)to Node5 (5) Remain: 20.646 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 4 to 5 .
  • A new virtual link (4, 5, 0) is created for queue 0 , request 105 , from Node4 to Node5 capacity requirement 20.646 Gbps, having free capacity 19.354 Gbps.
  • New neighbour 5 is appended.
  • New virtual link (4, 5) is appended.
  • Capacities are [19.354]
  • que 0 req 105 (src 4 dst 5 num 0) type New capacity 20.646 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(4,5)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,5,0)[(0,105,20.646,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,5,0)[20.646,19.354,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,105)[(4,5,0,'New',20.646,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11, 13], 9: [4, 7, 3, 10]}

    VT_after_Step106_Que0_Req105.html

    Time of processing all requests 599.736, Time of current queue's turn 99.736
    Step 107Processing queue 0request 106from Node1 (1)to Node11 (11) Remain: 20.627 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 1 to 11 .
  • A new virtual link (1, 11, 0) is created for queue 0 , request 106 , from Node1 to Node11 capacity requirement 20.627 Gbps, having free capacity 19.373 Gbps.
  • New neighbour 11 is appended.
  • New virtual link (1, 11) is appended.
  • Capacities are [19.373]
  • que 0 req 106 (src 1 dst 11 num 0) type New capacity 20.627 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(1,11)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(1,11,0)[(0,106,20.627,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,11,0)[20.627,19.373,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,106)[(1,11,0,'New',20.627,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11, 13], 9: [4, 7, 3, 10]}

    VT_after_Step107_Que0_Req106.html

    Time of processing all requests 605.984, Time of current queue's turn 5.984
    Step 108Processing queue 0request 107from Node2 (2)to Node9 (9) Remain: 20.555 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 2 to 9 .
  • A new virtual link (2, 9, 0) is created for queue 0 , request 107 , from Node2 to Node9 capacity requirement 20.555 Gbps, having free capacity 19.445 Gbps.
  • New neighbour 9 is appended.
  • New virtual link (2, 9) is appended.
  • Capacities are [19.445]
  • que 0 req 107 (src 2 dst 9 num 0) type New capacity 20.555 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(2,9)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,9,0)[(0,107,20.555,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,9,0)[20.555,19.445,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,107)[(2,9,0,'New',20.555,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11, 13, 9], 9: [4, 7, 3, 10]}

    VT_after_Step108_Que0_Req107.html

    Time of processing all requests 612.205, Time of current queue's turn 12.205
    Step 109Processing queue 0request 108from Node12 (12)to Node4 (4) Remain: 20.262 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 12 to 4 .
  • A new virtual link (12, 4, 0) is created for queue 0 , request 108 , from Node12 to Node4 capacity requirement 20.262 Gbps, having free capacity 19.738 Gbps.
  • New neighbour 4 is appended.
  • New virtual link (12, 4) is appended.
  • Capacities are [19.738]
  • que 0 req 108 (src 12 dst 4 num 0) type New capacity 20.262 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(12,4)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(12,4,0)[(0,108,20.262,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,4,0)[20.262,19.738,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,108)[(12,4,0,'New',20.262,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3, 4], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11, 13, 9], 9: [4, 7, 3, 10]}

    VT_after_Step109_Que0_Req108.html

    Time of processing all requests 618.296, Time of current queue's turn 18.296
    Step 110Processing queue 0request 109from Node4 (4)to Node12 (12) Remain: 20.156 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 4 to 12 .
  • A new virtual link (4, 12, 0) is created for queue 0 , request 109 , from Node4 to Node12 capacity requirement 20.156 Gbps, having free capacity 19.844 Gbps.
  • New neighbour 12 is appended.
  • New virtual link (4, 12) is appended.
  • Capacities are [19.844]
  • que 0 req 109 (src 4 dst 12 num 0) type New capacity 20.156 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(4,12)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,12,0)[(0,109,20.156,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,12,0)[20.156,19.844,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,109)[(4,12,0,'New',20.156,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3, 4], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11, 13, 9], 9: [4, 7, 3, 10]}

    VT_after_Step110_Que0_Req109.html

    Time of processing all requests 624.717, Time of current queue's turn 24.717
    Step 111Processing queue 0request 110from Node8 (8)to Node3 (3) Remain: 20.126 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 8 to 3 .
  • A new virtual link (8, 3, 0) is created for queue 0 , request 110 , from Node8 to Node3 capacity requirement 20.126 Gbps, having free capacity 19.874 Gbps.
  • New neighbour 3 is appended.
  • New virtual link (8, 3) is appended.
  • Capacities are [19.874]
  • que 0 req 110 (src 8 dst 3 num 0) type New capacity 20.126 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(8,3)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,3,0)[(0,110,20.126,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,3,0)[20.126,19.874,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,110)[(8,3,0,'New',20.126,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3, 4], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11, 13, 9], 9: [4, 7, 3, 10]}

    VT_after_Step111_Que0_Req110.html

    Time of processing all requests 631.151, Time of current queue's turn 31.151
    Step 112Processing queue 0request 111from Node9 (9)to Node11 (11) Remain: 19.803 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 9 to 11 .
  • A new virtual link (9, 11, 0) is created for queue 0 , request 111 , from Node9 to Node11 capacity requirement 19.803 Gbps, having free capacity 20.197 Gbps.
  • New neighbour 11 is appended.
  • New virtual link (9, 11) is appended.
  • Capacities are [20.197]
  • que 0 req 111 (src 9 dst 11 num 0) type New capacity 19.803 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(9,11)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,11,0)[(0,111,19.803,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,11,0)[19.803,20.197,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,111)[(9,11,0,'New',19.803,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3, 4], 6: [7, 9, 10, 4, 13, 3, 8], 2: [7, 4, 12, 6, 3, 11, 13, 9], 9: [4, 7, 3, 10, 11]}

    VT_after_Step112_Que0_Req111.html

    Time of processing all requests 637.379, Time of current queue's turn 37.379
    Step 113Processing queue 0request 112from Node6 (6)to Node1 (1) Remain: 19.594 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 6 to 1 .
  • A new virtual link (6, 1, 0) is created for queue 0 , request 112 , from Node6 to Node1 capacity requirement 19.594 Gbps, having free capacity 20.406 Gbps.
  • New neighbour 1 is appended.
  • New virtual link (6, 1) is appended.
  • Capacities are [20.406]
  • que 0 req 112 (src 6 dst 1 num 0) type New capacity 19.594 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(6,1)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,1,0)[(0,112,19.594,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,1,0)[19.594,20.406,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,112)[(6,1,0,'New',19.594,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3, 4], 6: [7, 9, 10, 4, 13, 3, 8, 1], 2: [7, 4, 12, 6, 3, 11, 13, 9], 9: [4, 7, 3, 10, 11]}

    VT_after_Step113_Que0_Req112.html

    Time of processing all requests 644.162, Time of current queue's turn 44.162
    Step 114Processing queue 0request 113from Node12 (12)to Node2 (2) Remain: 19.089 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 12 to 2 .
  • A new virtual link (12, 2, 0) is created for queue 0 , request 113 , from Node12 to Node2 capacity requirement 19.089 Gbps, having free capacity 20.911 Gbps.
  • New neighbour 2 is appended.
  • New virtual link (12, 2) is appended.
  • Capacities are [20.911]
  • que 0 req 113 (src 12 dst 2 num 0) type New capacity 19.089 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(12,2)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(12,2,0)[(0,113,19.089,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,2,0)[19.089,20.911,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,113)[(12,2,0,'New',19.089,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3, 4, 2], 6: [7, 9, 10, 4, 13, 3, 8, 1], 2: [7, 4, 12, 6, 3, 11, 13, 9], 9: [4, 7, 3, 10, 11]}

    VT_after_Step114_Que0_Req113.html

    Time of processing all requests 654.466, Time of current queue's turn 54.466
    Step 115Processing queue 0request 114from Node10 (10)to Node7 (7) Remain: 18.744 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 10 to 7 .
  • A new virtual link (10, 7, 0) is created for queue 0 , request 114 , from Node10 to Node7 capacity requirement 18.744 Gbps, having free capacity 21.256 Gbps.
  • New neighbour 7 is appended.
  • New virtual link (10, 7) is appended.
  • Capacities are [21.256]
  • que 0 req 114 (src 10 dst 7 num 0) type New capacity 18.744 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(10,7)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,7,0)[(0,114,18.744,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,7,0)[18.744,21.256,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,114)[(10,7,0,'New',18.744,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3, 4, 2], 6: [7, 9, 10, 4, 13, 3, 8, 1], 2: [7, 4, 12, 6, 3, 11, 13, 9], 9: [4, 7, 3, 10, 11]}

    VT_after_Step115_Que0_Req114.html

    Time of processing all requests 661.565, Time of current queue's turn 61.565
    Step 116Processing queue 0request 115from Node2 (2)to Node1 (1) Remain: 18.525 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 2 to 1 .
  • A new virtual link (2, 1, 0) is created for queue 0 , request 115 , from Node2 to Node1 capacity requirement 18.525 Gbps, having free capacity 21.475 Gbps.
  • New neighbour 1 is appended.
  • New virtual link (2, 1) is appended.
  • Capacities are [21.475]
  • que 0 req 115 (src 2 dst 1 num 0) type New capacity 18.525 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(2,1)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,1,0)[(0,115,18.525,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,1,0)[18.525,21.475,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,115)[(2,1,0,'New',18.525,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3, 4, 2], 6: [7, 9, 10, 4, 13, 3, 8, 1], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11]}

    VT_after_Step116_Que0_Req115.html

    Time of processing all requests 667.924, Time of current queue's turn 67.924
    Step 117Processing queue 0request 116from Node6 (6)to Node12 (12) Remain: 18.192 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 6 to 12 .
  • A new virtual link (6, 12, 0) is created for queue 0 , request 116 , from Node6 to Node12 capacity requirement 18.192 Gbps, having free capacity 21.808 Gbps.
  • New neighbour 12 is appended.
  • New virtual link (6, 12) is appended.
  • Capacities are [21.808]
  • que 0 req 116 (src 6 dst 12 num 0) type New capacity 18.192 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(6,12)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,12,0)[(0,116,18.192,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,12,0)[18.192,21.808,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,116)[(6,12,0,'New',18.192,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3, 4, 2], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11]}

    VT_after_Step117_Que0_Req116.html

    Time of processing all requests 674.214, Time of current queue's turn 74.214
    Step 118Processing queue 0request 117from Node10 (10)to Node3 (3) Remain: 18.079 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 10 to 3 .
  • A new virtual link (10, 3, 0) is created for queue 0 , request 117 , from Node10 to Node3 capacity requirement 18.079 Gbps, having free capacity 21.921 Gbps.
  • New neighbour 3 is appended.
  • New virtual link (10, 3) is appended.
  • Capacities are [21.921]
  • que 0 req 117 (src 10 dst 3 num 0) type New capacity 18.079 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(10,3)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,3,0)[(0,117,18.079,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,3,0)[18.079,21.921,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,117)[(10,3,0,'New',18.079,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3], 0: [9, 1, 8, 7, 13, 6, 10], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3, 4, 2], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11]}

    VT_after_Step118_Que0_Req117.html

    Time of processing all requests 680.607, Time of current queue's turn 80.607
    Step 119Processing queue 0request 118from Node0 (0)to Node4 (4) Remain: 17.721 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 0 to 4 .
  • A new virtual link (0, 4, 0) is created for queue 0 , request 118 , from Node0 to Node4 capacity requirement 17.721 Gbps, having free capacity 22.279 Gbps.
  • New neighbour 4 is appended.
  • New virtual link (0, 4) is appended.
  • Capacities are [22.279]
  • que 0 req 118 (src 0 dst 4 num 0) type New capacity 17.721 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(0,4)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,4,0)[(0,118,17.721,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,4,0)[17.721,22.279,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,118)[(0,4,0,'New',17.721,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3, 4, 2], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11]}

    VT_after_Step119_Que0_Req118.html

    Time of processing all requests 687.163, Time of current queue's turn 87.163
    Step 120Processing queue 0request 119from Node9 (9)to Node5 (5) Remain: 17.237 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 9 to 5 .
  • A new virtual link (9, 5, 0) is created for queue 0 , request 119 , from Node9 to Node5 capacity requirement 17.237 Gbps, having free capacity 22.763 Gbps.
  • New neighbour 5 is appended.
  • New virtual link (9, 5) is appended.
  • Capacities are [22.763]
  • que 0 req 119 (src 9 dst 5 num 0) type New capacity 17.237 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(9,5)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,5,0)[(0,119,17.237,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,5,0)[17.237,22.763,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,119)[(9,5,0,'New',17.237,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3, 4, 2], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5]}

    VT_after_Step120_Que0_Req119.html

    Time of processing all requests 693.610, Time of current queue's turn 93.610
    Step 121Processing queue 0request 120from Node3 (3)to Node11 (11) Remain: 17.014 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 3 to 11 .
  • A new virtual link (3, 11, 0) is created for queue 0 , request 120 , from Node3 to Node11 capacity requirement 17.014 Gbps, having free capacity 22.986 Gbps.
  • New neighbour 11 is appended.
  • New virtual link (3, 11) is appended.
  • Capacities are [22.986]
  • que 0 req 120 (src 3 dst 11 num 0) type New capacity 17.014 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(3,11)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,11,0)[(0,120,17.014,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,11,0)[17.014,22.986,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,120)[(3,11,0,'New',17.014,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3, 4, 2], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5]}

    VT_after_Step121_Que0_Req120.html

    Time of processing all requests 700.171, Time of current queue's turn 0.171
    Step 122Processing queue 0request 121from Node3 (3)to Node0 (0) Remain: 16.747 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 3 to 0 .
  • A new virtual link (3, 0, 0) is created for queue 0 , request 121 , from Node3 to Node0 capacity requirement 16.747 Gbps, having free capacity 23.253 Gbps.
  • New neighbour 0 is appended.
  • New virtual link (3, 0) is appended.
  • Capacities are [23.253]
  • que 0 req 121 (src 3 dst 0 num 0) type New capacity 16.747 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(3,0)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,0,0)[(0,121,16.747,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,0,0)[16.747,23.253,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,121)[(3,0,0,'New',16.747,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5], 12: [8, 9, 13, 0, 10, 3, 4, 2], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5]}

    VT_after_Step122_Que0_Req121.html

    Time of processing all requests 706.754, Time of current queue's turn 6.754
    Step 123Processing queue 0request 122from Node7 (7)to Node11 (11) Remain: 16.71 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 7 to 11 .
  • A new virtual link (7, 11, 0) is created for queue 0 , request 122 , from Node7 to Node11 capacity requirement 16.71 Gbps, having free capacity 23.29 Gbps.
  • New neighbour 11 is appended.
  • New virtual link (7, 11) is appended.
  • Capacities are [23.29]
  • que 0 req 122 (src 7 dst 11 num 0) type New capacity 16.710 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(7,11)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,11,0)[(0,122,16.710,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,11,0)[16.710,23.290,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,122)[(7,11,0,'New',16.710,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5, 11], 12: [8, 9, 13, 0, 10, 3, 4, 2], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5]}

    VT_after_Step123_Que0_Req122.html

    Time of processing all requests 713.294, Time of current queue's turn 13.294
    Step 124Processing queue 0request 123from Node11 (11)to Node0 (0) Remain: 16.593 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 11 to 0 .
  • A new virtual link (11, 0, 0) is created for queue 0 , request 123 , from Node11 to Node0 capacity requirement 16.593 Gbps, having free capacity 23.407 Gbps.
  • New neighbour 0 is appended.
  • New virtual link (11, 0) is appended.
  • Capacities are [23.407]
  • que 0 req 123 (src 11 dst 0 num 0) type New capacity 16.593 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(11,0)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,0,0)[(0,123,16.593,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,0,0)[16.593,23.407,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,123)[(11,0,0,'New',16.593,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5, 11], 12: [8, 9, 13, 0, 10, 3, 4, 2], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5]}

    VT_after_Step124_Que0_Req123.html

    Time of processing all requests 719.967, Time of current queue's turn 19.967
    Step 125Processing queue 0request 124from Node6 (6)to Node2 (2) Remain: 16.583 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 6 to 2 .
  • A new virtual link (6, 2, 0) is created for queue 0 , request 124 , from Node6 to Node2 capacity requirement 16.583 Gbps, having free capacity 23.417 Gbps.
  • New neighbour 2 is appended.
  • New virtual link (6, 2) is appended.
  • Capacities are [23.417]
  • que 0 req 124 (src 6 dst 2 num 0) type New capacity 16.583 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(6,2)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,2,0)[(0,124,16.583,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,2,0)[16.583,23.417,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,124)[(6,2,0,'New',16.583,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5, 11], 12: [8, 9, 13, 0, 10, 3, 4, 2], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5]}

    VT_after_Step125_Que0_Req124.html

    Time of processing all requests 726.493, Time of current queue's turn 26.493
    Step 126Processing queue 0request 125from Node12 (12)to Node1 (1) Remain: 16.488 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 12 to 1 .
  • A new virtual link (12, 1, 0) is created for queue 0 , request 125 , from Node12 to Node1 capacity requirement 16.488 Gbps, having free capacity 23.512 Gbps.
  • New neighbour 1 is appended.
  • New virtual link (12, 1) is appended.
  • Capacities are [23.512]
  • que 0 req 125 (src 12 dst 1 num 0) type New capacity 16.488 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(12,1)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(12,1,0)[(0,125,16.488,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,1,0)[16.488,23.512,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,125)[(12,1,0,'New',16.488,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5, 11], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5]}

    VT_after_Step126_Que0_Req125.html

    Time of processing all requests 732.909, Time of current queue's turn 32.909
    Step 127Processing queue 0request 126from Node6 (6)to Node5 (5) Remain: 16.444 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 6 to 5 .
  • A new virtual link (6, 5, 0) is created for queue 0 , request 126 , from Node6 to Node5 capacity requirement 16.444 Gbps, having free capacity 23.556 Gbps.
  • New neighbour 5 is appended.
  • New virtual link (6, 5) is appended.
  • Capacities are [23.556]
  • que 0 req 126 (src 6 dst 5 num 0) type New capacity 16.444 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(6,5)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,5,0)[(0,126,16.444,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,5,0)[16.444,23.556,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,126)[(6,5,0,'New',16.444,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0], 7: [3, 1, 9, 12, 6, 2, 5, 11], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5]}

    VT_after_Step127_Que0_Req126.html

    Time of processing all requests 739.400, Time of current queue's turn 39.400
    Step 128Processing queue 0request 127from Node5 (5)to Node6 (6) Remain: 16.247 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 5 to 6 .
  • A new virtual link (5, 6, 0) is created for queue 0 , request 127 , from Node5 to Node6 capacity requirement 16.247 Gbps, having free capacity 23.753 Gbps.
  • New neighbour 6 is appended.
  • New virtual link (5, 6) is appended.
  • Capacities are [23.753]
  • que 0 req 127 (src 5 dst 6 num 0) type New capacity 16.247 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(5,6)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,6,0)[(0,127,16.247,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,6,0)[16.247,23.753,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,127)[(5,6,0,'New',16.247,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6], 7: [3, 1, 9, 12, 6, 2, 5, 11], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5]}

    VT_after_Step128_Que0_Req127.html

    Time of processing all requests 745.612, Time of current queue's turn 45.612
    Step 129Processing queue 0request 128from Node9 (9)to Node12 (12) Remain: 15.92 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 9 to 12 .
  • A new virtual link (9, 12, 0) is created for queue 0 , request 128 , from Node9 to Node12 capacity requirement 15.92 Gbps, having free capacity 24.08 Gbps.
  • New neighbour 12 is appended.
  • New virtual link (9, 12) is appended.
  • Capacities are [24.08]
  • que 0 req 128 (src 9 dst 12 num 0) type New capacity 15.920 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(9,12)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,12,0)[(0,128,15.920,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,12,0)[15.920,24.080,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,128)[(9,12,0,'New',15.920,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6], 7: [3, 1, 9, 12, 6, 2, 5, 11], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12]}

    VT_after_Step129_Que0_Req128.html

    Time of processing all requests 752.159, Time of current queue's turn 52.159
    Step 130Processing queue 0request 129from Node12 (12)to Node6 (6) Remain: 15.891 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 12 to 6 .
  • A new virtual link (12, 6, 0) is created for queue 0 , request 129 , from Node12 to Node6 capacity requirement 15.891 Gbps, having free capacity 24.109 Gbps.
  • New neighbour 6 is appended.
  • New virtual link (12, 6) is appended.
  • Capacities are [24.109]
  • que 0 req 129 (src 12 dst 6 num 0) type New capacity 15.891 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(12,6)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(12,6,0)[(0,129,15.891,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,6,0)[15.891,24.109,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,129)[(12,6,0,'New',15.891,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6], 7: [3, 1, 9, 12, 6, 2, 5, 11], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12]}

    VT_after_Step130_Que0_Req129.html

    Time of processing all requests 758.625, Time of current queue's turn 58.625
    Step 131Processing queue 0request 130from Node7 (7)to Node8 (8) Remain: 15.747 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 7 to 8 .
  • A new virtual link (7, 8, 0) is created for queue 0 , request 130 , from Node7 to Node8 capacity requirement 15.747 Gbps, having free capacity 24.253 Gbps.
  • New neighbour 8 is appended.
  • New virtual link (7, 8) is appended.
  • Capacities are [24.253]
  • que 0 req 130 (src 7 dst 8 num 0) type New capacity 15.747 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(7,8)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,8,0)[(0,130,15.747,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,8,0)[15.747,24.253,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,130)[(7,8,0,'New',15.747,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12]}

    VT_after_Step131_Que0_Req130.html

    Time of processing all requests 765.496, Time of current queue's turn 65.496
    Step 132Processing queue 0request 131from Node10 (10)to Node6 (6) Remain: 15.516 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 10 to 6 .
  • A new virtual link (10, 6, 0) is created for queue 0 , request 131 , from Node10 to Node6 capacity requirement 15.516 Gbps, having free capacity 24.484 Gbps.
  • New neighbour 6 is appended.
  • New virtual link (10, 6) is appended.
  • Capacities are [24.484]
  • que 0 req 131 (src 10 dst 6 num 0) type New capacity 15.516 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(10,6)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,6,0)[(0,131,15.516,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,6,0)[15.516,24.484,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,131)[(10,6,0,'New',15.516,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12]}

    VT_after_Step132_Que0_Req131.html

    Time of processing all requests 772.039, Time of current queue's turn 72.039
    Step 133Processing queue 0request 132from Node8 (8)to Node1 (1) Remain: 15.407 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 8 to 1 .
  • A new virtual link (8, 1, 0) is created for queue 0 , request 132 , from Node8 to Node1 capacity requirement 15.407 Gbps, having free capacity 24.593 Gbps.
  • New neighbour 1 is appended.
  • New virtual link (8, 1) is appended.
  • Capacities are [24.593]
  • que 0 req 132 (src 8 dst 1 num 0) type New capacity 15.407 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(8,1)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,1,0)[(0,132,15.407,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,1,0)[15.407,24.593,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,132)[(8,1,0,'New',15.407,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12]}

    VT_after_Step133_Que0_Req132.html

    Time of processing all requests 778.946, Time of current queue's turn 78.946
    Step 134Processing queue 0request 133from Node9 (9)to Node0 (0) Remain: 15.179 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 9 to 0 .
  • A new virtual link (9, 0, 0) is created for queue 0 , request 133 , from Node9 to Node0 capacity requirement 15.179 Gbps, having free capacity 24.821 Gbps.
  • New neighbour 0 is appended.
  • New virtual link (9, 0) is appended.
  • Capacities are [24.821]
  • que 0 req 133 (src 9 dst 0 num 0) type New capacity 15.179 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(9,0)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,0,0)[(0,133,15.179,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,0,0)[15.179,24.821,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,133)[(9,0,0,'New',15.179,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0]}

    VT_after_Step134_Que0_Req133.html

    Time of processing all requests 785.429, Time of current queue's turn 85.429
    Step 135Processing queue 0request 134from Node10 (10)to Node1 (1) Remain: 14.658 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 10 to 1 .
  • A new virtual link (10, 1, 0) is created for queue 0 , request 134 , from Node10 to Node1 capacity requirement 14.658 Gbps, having free capacity 25.342 Gbps.
  • New neighbour 1 is appended.
  • New virtual link (10, 1) is appended.
  • Capacities are [25.342]
  • que 0 req 134 (src 10 dst 1 num 0) type New capacity 14.658 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(10,1)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,1,0)[(0,134,14.658,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,1,0)[14.658,25.342,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,134)[(10,1,0,'New',14.658,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0]}

    VT_after_Step135_Que0_Req134.html

    Time of processing all requests 792.007, Time of current queue's turn 92.007
    Step 136Processing queue 0request 135from Node7 (7)to Node10 (10) Remain: 14.494 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 7 to 10 .
  • A new virtual link (7, 10, 0) is created for queue 0 , request 135 , from Node7 to Node10 capacity requirement 14.494 Gbps, having free capacity 25.506 Gbps.
  • New neighbour 10 is appended.
  • New virtual link (7, 10) is appended.
  • Capacities are [25.506]
  • que 0 req 135 (src 7 dst 10 num 0) type New capacity 14.494 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(7,10)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,10,0)[(0,135,14.494,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,10,0)[14.494,25.506,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,135)[(7,10,0,'New',14.494,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0]}

    VT_after_Step136_Que0_Req135.html

    Time of processing all requests 798.796, Time of current queue's turn 98.796
    Step 137Processing queue 0request 136from Node9 (9)to Node1 (1) Remain: 14.467 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 9 to 1 .
  • A new virtual link (9, 1, 0) is created for queue 0 , request 136 , from Node9 to Node1 capacity requirement 14.467 Gbps, having free capacity 25.533 Gbps.
  • New neighbour 1 is appended.
  • New virtual link (9, 1) is appended.
  • Capacities are [25.533]
  • que 0 req 136 (src 9 dst 1 num 0) type New capacity 14.467 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(9,1)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,1,0)[(0,136,14.467,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,1,0)[14.467,25.533,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,136)[(9,1,0,'New',14.467,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1]}

    VT_after_Step137_Que0_Req136.html

    Time of processing all requests 805.379, Time of current queue's turn 5.379
    Step 138Processing queue 0request 137from Node5 (5)to Node9 (9) Remain: 14.437 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 5 to 9 .
  • A new virtual link (5, 9, 0) is created for queue 0 , request 137 , from Node5 to Node9 capacity requirement 14.437 Gbps, having free capacity 25.563 Gbps.
  • New neighbour 9 is appended.
  • New virtual link (5, 9) is appended.
  • Capacities are [25.563]
  • que 0 req 137 (src 5 dst 9 num 0) type New capacity 14.437 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(5,9)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,9,0)[(0,137,14.437,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,9,0)[14.437,25.563,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,137)[(5,9,0,'New',14.437,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1], 0: [9, 1, 8, 7, 13, 6, 10, 4], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1]}

    VT_after_Step138_Que0_Req137.html

    Time of processing all requests 811.427, Time of current queue's turn 11.427
    Step 139Processing queue 0request 138from Node0 (0)to Node3 (3) Remain: 13.992 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 0 to 3 .
  • A new virtual link (0, 3, 0) is created for queue 0 , request 138 , from Node0 to Node3 capacity requirement 13.992 Gbps, having free capacity 26.008 Gbps.
  • New neighbour 3 is appended.
  • New virtual link (0, 3) is appended.
  • Capacities are [26.008]
  • que 0 req 138 (src 0 dst 3 num 0) type New capacity 13.992 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(0,3)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,3,0)[(0,138,13.992,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,3,0)[13.992,26.008,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,138)[(0,3,0,'New',13.992,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1]}

    VT_after_Step139_Que0_Req138.html

    Time of processing all requests 818.018, Time of current queue's turn 18.018
    Step 140Processing queue 0request 139from Node9 (9)to Node8 (8) Remain: 13.938 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 9 to 8 .
  • A new virtual link (9, 8, 0) is created for queue 0 , request 139 , from Node9 to Node8 capacity requirement 13.938 Gbps, having free capacity 26.062 Gbps.
  • New neighbour 8 is appended.
  • New virtual link (9, 8) is appended.
  • Capacities are [26.062]
  • que 0 req 139 (src 9 dst 8 num 0) type New capacity 13.938 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(9,8)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,8,0)[(0,139,13.938,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,8,0)[13.938,26.062,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,139)[(9,8,0,'New',13.938,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step140_Que0_Req139.html

    Time of processing all requests 823.991, Time of current queue's turn 23.991
    Step 141Processing queue 0request 140from Node10 (10)to Node5 (5) Remain: 13.448 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 10 to 5 .
  • A new virtual link (10, 5, 0) is created for queue 0 , request 140 , from Node10 to Node5 capacity requirement 13.448 Gbps, having free capacity 26.552 Gbps.
  • New neighbour 5 is appended.
  • New virtual link (10, 5) is appended.
  • Capacities are [26.552]
  • que 0 req 140 (src 10 dst 5 num 0) type New capacity 13.448 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(10,5)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,5,0)[(0,140,13.448,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,5,0)[13.448,26.552,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,140)[(10,5,0,'New',13.448,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step141_Que0_Req140.html

    Time of processing all requests 830.659, Time of current queue's turn 30.659
    Step 142Processing queue 0request 141from Node11 (11)to Node9 (9) Remain: 13.445 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 11 to 9 .
  • A new virtual link (11, 9, 0) is created for queue 0 , request 141 , from Node11 to Node9 capacity requirement 13.445 Gbps, having free capacity 26.555 Gbps.
  • New neighbour 9 is appended.
  • New virtual link (11, 9) is appended.
  • Capacities are [26.555]
  • que 0 req 141 (src 11 dst 9 num 0) type New capacity 13.445 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(11,9)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,9,0)[(0,141,13.445,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,9,0)[13.445,26.555,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,141)[(11,9,0,'New',13.445,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step142_Que0_Req141.html

    Time of processing all requests 837.229, Time of current queue's turn 37.229
    Step 143Processing queue 0request 142from Node0 (0)to Node2 (2) Remain: 13.19 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 0 to 2 .
  • A new virtual link (0, 2, 0) is created for queue 0 , request 142 , from Node0 to Node2 capacity requirement 13.19 Gbps, having free capacity 26.81 Gbps.
  • New neighbour 2 is appended.
  • New virtual link (0, 2) is appended.
  • Capacities are [26.81]
  • que 0 req 142 (src 0 dst 2 num 0) type New capacity 13.190 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(0,2)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,2,0)[(0,142,13.190,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,2,0)[13.190,26.810,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,142)[(0,2,0,'New',13.190,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step143_Que0_Req142.html

    Time of processing all requests 843.847, Time of current queue's turn 43.847
    Step 144Processing queue 0request 143from Node7 (7)to Node0 (0) Remain: 12.377 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 7 to 0 .
  • A new virtual link (7, 0, 0) is created for queue 0 , request 143 , from Node7 to Node0 capacity requirement 12.377 Gbps, having free capacity 27.623 Gbps.
  • New neighbour 0 is appended.
  • New virtual link (7, 0) is appended.
  • Capacities are [27.623]
  • que 0 req 143 (src 7 dst 0 num 0) type New capacity 12.377 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(7,0)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,0,0)[(0,143,12.377,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,0,0)[12.377,27.623,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,143)[(7,0,0,'New',12.377,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step144_Que0_Req143.html

    Time of processing all requests 850.593, Time of current queue's turn 50.593
    Step 145Processing queue 0request 144from Node4 (4)to Node1 (1) Remain: 12.3 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 4 to 1 .
  • A new virtual link (4, 1, 0) is created for queue 0 , request 144 , from Node4 to Node1 capacity requirement 12.3 Gbps, having free capacity 27.7 Gbps.
  • New neighbour 1 is appended.
  • New virtual link (4, 1) is appended.
  • Capacities are [27.7]
  • que 0 req 144 (src 4 dst 1 num 0) type New capacity 12.300 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(4,1)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,1,0)[(0,144,12.300,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,1,0)[12.300,27.700,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,144)[(4,1,0,'New',12.300,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step145_Que0_Req144.html

    Time of processing all requests 857.138, Time of current queue's turn 57.138
    Step 146Processing queue 0request 145from Node6 (6)to Node0 (0) Remain: 11.91 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 6 to 0 .
  • A new virtual link (6, 0, 0) is created for queue 0 , request 145 , from Node6 to Node0 capacity requirement 11.91 Gbps, having free capacity 28.09 Gbps.
  • New neighbour 0 is appended.
  • New virtual link (6, 0) is appended.
  • Capacities are [28.09]
  • que 0 req 145 (src 6 dst 0 num 0) type New capacity 11.910 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(6,0)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,0,0)[(0,145,11.910,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,0,0)[11.910,28.090,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,145)[(6,0,0,'New',11.910,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step146_Que0_Req145.html

    Time of processing all requests 863.855, Time of current queue's turn 63.855
    Step 147Processing queue 0request 146from Node4 (4)to Node8 (8) Remain: 11.487 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 4 to 8 .
  • A new virtual link (4, 8, 0) is created for queue 0 , request 146 , from Node4 to Node8 capacity requirement 11.487 Gbps, having free capacity 28.513 Gbps.
  • New neighbour 8 is appended.
  • New virtual link (4, 8) is appended.
  • Capacities are [28.513]
  • que 0 req 146 (src 4 dst 8 num 0) type New capacity 11.487 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(4,8)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,8,0)[(0,146,11.487,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,8,0)[11.487,28.513,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,146)[(4,8,0,'New',11.487,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step147_Que0_Req146.html

    Time of processing all requests 870.507, Time of current queue's turn 70.507
    Step 148Processing queue 0request 147from Node12 (12)to Node7 (7) Remain: 11.392 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 12 to 7 .
  • A new virtual link (12, 7, 0) is created for queue 0 , request 147 , from Node12 to Node7 capacity requirement 11.392 Gbps, having free capacity 28.608 Gbps.
  • New neighbour 7 is appended.
  • New virtual link (12, 7) is appended.
  • Capacities are [28.608]
  • que 0 req 147 (src 12 dst 7 num 0) type New capacity 11.392 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(12,7)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(12,7,0)[(0,147,11.392,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,7,0)[11.392,28.608,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,147)[(12,7,0,'New',11.392,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step148_Que0_Req147.html

    Time of processing all requests 877.127, Time of current queue's turn 77.127
    Step 149Processing queue 0request 148from Node5 (5)to Node4 (4) Remain: 11.203 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 5 to 4 .
  • A new virtual link (5, 4, 0) is created for queue 0 , request 148 , from Node5 to Node4 capacity requirement 11.203 Gbps, having free capacity 28.797 Gbps.
  • New neighbour 4 is appended.
  • New virtual link (5, 4) is appended.
  • Capacities are [28.797]
  • que 0 req 148 (src 5 dst 4 num 0) type New capacity 11.203 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(5,4)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,4,0)[(0,148,11.203,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,4,0)[11.203,28.797,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,148)[(5,4,0,'New',11.203,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step149_Que0_Req148.html

    Time of processing all requests 883.780, Time of current queue's turn 83.780
    Step 150Processing queue 0request 149from Node0 (0)to Node11 (11) Remain: 11.165 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 0 to 11 .
  • A new virtual link (0, 11, 0) is created for queue 0 , request 149 , from Node0 to Node11 capacity requirement 11.165 Gbps, having free capacity 28.835 Gbps.
  • New neighbour 11 is appended.
  • New virtual link (0, 11) is appended.
  • Capacities are [28.835]
  • que 0 req 149 (src 0 dst 11 num 0) type New capacity 11.165 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(0,11)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,11,0)[(0,149,11.165,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,11,0)[11.165,28.835,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,149)[(0,11,0,'New',11.165,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step150_Que0_Req149.html

    Time of processing all requests 890.415, Time of current queue's turn 90.415
    Step 151Processing queue 0request 150from Node0 (0)to Node12 (12) Remain: 11.056 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 0 to 12 .
  • A new virtual link (0, 12, 0) is created for queue 0 , request 150 , from Node0 to Node12 capacity requirement 11.056 Gbps, having free capacity 28.944 Gbps.
  • New neighbour 12 is appended.
  • New virtual link (0, 12) is appended.
  • Capacities are [28.944]
  • que 0 req 150 (src 0 dst 12 num 0) type New capacity 11.056 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(0,12)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,12,0)[(0,150,11.056,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,12,0)[11.056,28.944,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,150)[(0,12,0,'New',11.056,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step151_Que0_Req150.html

    Time of processing all requests 897.815, Time of current queue's turn 97.815
    Step 152Processing queue 0request 151from Node2 (2)to Node5 (5) Remain: 10.878 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 2 to 5 .
  • A new virtual link (2, 5, 0) is created for queue 0 , request 151 , from Node2 to Node5 capacity requirement 10.878 Gbps, having free capacity 29.122 Gbps.
  • New neighbour 5 is appended.
  • New virtual link (2, 5) is appended.
  • Capacities are [29.122]
  • que 0 req 151 (src 2 dst 5 num 0) type New capacity 10.878 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(2,5)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,5,0)[(0,151,10.878,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,5,0)[10.878,29.122,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,151)[(2,5,0,'New',10.878,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step152_Que0_Req151.html

    Time of processing all requests 904.916, Time of current queue's turn 4.916
    Step 153Processing queue 0request 152from Node3 (3)to Node2 (2) Remain: 10.458 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 3 to 2 .
  • A new virtual link (3, 2, 0) is created for queue 0 , request 152 , from Node3 to Node2 capacity requirement 10.458 Gbps, having free capacity 29.542 Gbps.
  • New neighbour 2 is appended.
  • New virtual link (3, 2) is appended.
  • Capacities are [29.542]
  • que 0 req 152 (src 3 dst 2 num 0) type New capacity 10.458 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(3,2)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,2,0)[(0,152,10.458,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,2,0)[10.458,29.542,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,152)[(3,2,0,'New',10.458,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step153_Que0_Req152.html

    Time of processing all requests 911.606, Time of current queue's turn 11.606
    Step 154Processing queue 0request 153from Node7 (7)to Node13 (13) Remain: 10.357 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 7 to 13 .
  • A new virtual link (7, 13, 0) is created for queue 0 , request 153 , from Node7 to Node13 capacity requirement 10.357 Gbps, having free capacity 29.643 Gbps.
  • New neighbour 13 is appended.
  • New virtual link (7, 13) is appended.
  • Capacities are [29.643]
  • que 0 req 153 (src 7 dst 13 num 0) type New capacity 10.357 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(7,13)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,13,0)[(0,153,10.357,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,13,0)[10.357,29.643,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,153)[(7,13,0,'New',10.357,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step154_Que0_Req153.html

    Time of processing all requests 916.796, Time of current queue's turn 16.796
    Step 155Processing queue 0request 154from Node1 (1)to Node13 (13) Remain: 10.18 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 1 to 13 .
  • A new virtual link (1, 13, 0) is created for queue 0 , request 154 , from Node1 to Node13 capacity requirement 10.18 Gbps, having free capacity 29.82 Gbps.
  • New neighbour 13 is appended.
  • New virtual link (1, 13) is appended.
  • Capacities are [29.82]
  • que 0 req 154 (src 1 dst 13 num 0) type New capacity 10.180 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(1,13)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(1,13,0)[(0,154,10.180,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,13,0)[10.180,29.820,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,154)[(1,13,0,'New',10.180,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1], 1: [2, 6, 4, 7, 0, 11, 13], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step155_Que0_Req154.html

    Time of processing all requests 923.319, Time of current queue's turn 23.319
    Step 156Processing queue 0request 155from Node8 (8)to Node13 (13) Remain: 9.942 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 8 to 13 .
  • A new virtual link (8, 13, 0) is created for queue 0 , request 155 , from Node8 to Node13 capacity requirement 9.942 Gbps, having free capacity 30.058 Gbps.
  • New neighbour 13 is appended.
  • New virtual link (8, 13) is appended.
  • Capacities are [30.058]
  • que 0 req 155 (src 8 dst 13 num 0) type New capacity 9.942 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(8,13)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,13,0)[(0,155,9.942,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,13,0)[9.942,30.058,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,155)[(8,13,0,'New',9.942,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13], 1: [2, 6, 4, 7, 0, 11, 13], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step156_Que0_Req155.html

    Time of processing all requests 930.006, Time of current queue's turn 30.006
    Step 157Processing queue 0request 156from Node1 (1)to Node12 (12) Remain: 9.936 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 1 to 12 .
  • A new virtual link (1, 12, 0) is created for queue 0 , request 156 , from Node1 to Node12 capacity requirement 9.936 Gbps, having free capacity 30.064 Gbps.
  • New neighbour 12 is appended.
  • New virtual link (1, 12) is appended.
  • Capacities are [30.064]
  • que 0 req 156 (src 1 dst 12 num 0) type New capacity 9.936 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(1,12)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(1,12,0)[(0,156,9.936,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,12,0)[9.936,30.064,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,156)[(1,12,0,'New',9.936,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13], 1: [2, 6, 4, 7, 0, 11, 13, 12], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step157_Que0_Req156.html

    Time of processing all requests 937.288, Time of current queue's turn 37.288
    Step 158Processing queue 0request 157from Node6 (6)to Node11 (11) Remain: 9.775 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 6 to 11 .
  • A new virtual link (6, 11, 0) is created for queue 0 , request 157 , from Node6 to Node11 capacity requirement 9.775 Gbps, having free capacity 30.225 Gbps.
  • New neighbour 11 is appended.
  • New virtual link (6, 11) is appended.
  • Capacities are [30.225]
  • que 0 req 157 (src 6 dst 11 num 0) type New capacity 9.775 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(6,11)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,11,0)[(0,157,9.775,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,11,0)[9.775,30.225,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,157)[(6,11,0,'New',9.775,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13], 1: [2, 6, 4, 7, 0, 11, 13, 12], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step158_Que0_Req157.html

    Time of processing all requests 944.288, Time of current queue's turn 44.288
    Step 159Processing queue 0request 158from Node2 (2)to Node10 (10) Remain: 9.638 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 2 to 10 .
  • A new virtual link (2, 10, 0) is created for queue 0 , request 158 , from Node2 to Node10 capacity requirement 9.638 Gbps, having free capacity 30.362 Gbps.
  • New neighbour 10 is appended.
  • New virtual link (2, 10) is appended.
  • Capacities are [30.362]
  • que 0 req 158 (src 2 dst 10 num 0) type New capacity 9.638 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(2,10)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,10,0)[(0,158,9.638,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,10,0)[9.638,30.362,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,158)[(2,10,0,'New',9.638,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13], 1: [2, 6, 4, 7, 0, 11, 13, 12], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step159_Que0_Req158.html

    Time of processing all requests 951.481, Time of current queue's turn 51.481
    Step 160Processing queue 0request 159from Node2 (2)to Node8 (8) Remain: 9.596 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 2 to 8 .
  • A new virtual link (2, 8, 0) is created for queue 0 , request 159 , from Node2 to Node8 capacity requirement 9.596 Gbps, having free capacity 30.404 Gbps.
  • New neighbour 8 is appended.
  • New virtual link (2, 8) is appended.
  • Capacities are [30.404]
  • que 0 req 159 (src 2 dst 8 num 0) type New capacity 9.596 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(2,8)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,8,0)[(0,159,9.596,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,8,0)[9.596,30.404,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,159)[(2,8,0,'New',9.596,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13], 1: [2, 6, 4, 7, 0, 11, 13, 12], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8]}

    VT_after_Step160_Que0_Req159.html

    Time of processing all requests 958.877, Time of current queue's turn 58.877
    Step 161Processing queue 0request 160from Node9 (9)to Node2 (2) Remain: 9.403 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 9 to 2 .
  • A new virtual link (9, 2, 0) is created for queue 0 , request 160 , from Node9 to Node2 capacity requirement 9.403 Gbps, having free capacity 30.597 Gbps.
  • New neighbour 2 is appended.
  • New virtual link (9, 2) is appended.
  • Capacities are [30.597]
  • que 0 req 160 (src 9 dst 2 num 0) type New capacity 9.403 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(9,2)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,2,0)[(0,160,9.403,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,2,0)[9.403,30.597,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,160)[(9,2,0,'New',9.403,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13], 1: [2, 6, 4, 7, 0, 11, 13, 12], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2]}

    VT_after_Step161_Que0_Req160.html

    Time of processing all requests 965.838, Time of current queue's turn 65.838
    Step 162Processing queue 0request 161from Node8 (8)to Node6 (6) Remain: 9.307 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 8 to 6 .
  • A new virtual link (8, 6, 0) is created for queue 0 , request 161 , from Node8 to Node6 capacity requirement 9.307 Gbps, having free capacity 30.693 Gbps.
  • New neighbour 6 is appended.
  • New virtual link (8, 6) is appended.
  • Capacities are [30.693]
  • que 0 req 161 (src 8 dst 6 num 0) type New capacity 9.307 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(8,6)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,6,0)[(0,161,9.307,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,6,0)[9.307,30.693,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,161)[(8,6,0,'New',9.307,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6], 1: [2, 6, 4, 7, 0, 11, 13, 12], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2]}

    VT_after_Step162_Que0_Req161.html

    Time of processing all requests 972.728, Time of current queue's turn 72.728
    Step 163Processing queue 0request 162from Node12 (12)to Node11 (11) Remain: 9.302 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 12 to 11 .
  • A new virtual link (12, 11, 0) is created for queue 0 , request 162 , from Node12 to Node11 capacity requirement 9.302 Gbps, having free capacity 30.698 Gbps.
  • New neighbour 11 is appended.
  • New virtual link (12, 11) is appended.
  • Capacities are [30.698]
  • que 0 req 162 (src 12 dst 11 num 0) type New capacity 9.302 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(12,11)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(12,11,0)[(0,162,9.302,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,11,0)[9.302,30.698,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,162)[(12,11,0,'New',9.302,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6], 1: [2, 6, 4, 7, 0, 11, 13, 12], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2]}

    VT_after_Step163_Que0_Req162.html

    Time of processing all requests 980.119, Time of current queue's turn 80.119
    Step 164Processing queue 0request 163from Node9 (9)to Node6 (6) Remain: 9.215 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 9 to 6 .
  • A new virtual link (9, 6, 0) is created for queue 0 , request 163 , from Node9 to Node6 capacity requirement 9.215 Gbps, having free capacity 30.785 Gbps.
  • New neighbour 6 is appended.
  • New virtual link (9, 6) is appended.
  • Capacities are [30.785]
  • que 0 req 163 (src 9 dst 6 num 0) type New capacity 9.215 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(9,6)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,6,0)[(0,163,9.215,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,6,0)[9.215,30.785,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,163)[(9,6,0,'New',9.215,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6], 1: [2, 6, 4, 7, 0, 11, 13, 12], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6]}

    VT_after_Step164_Que0_Req163.html

    Time of processing all requests 987.131, Time of current queue's turn 87.131
    Step 165Processing queue 0request 164from Node0 (0)to Node5 (5) Remain: 9.178 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 0 to 5 .
  • A new virtual link (0, 5, 0) is created for queue 0 , request 164 , from Node0 to Node5 capacity requirement 9.178 Gbps, having free capacity 30.822 Gbps.
  • New neighbour 5 is appended.
  • New virtual link (0, 5) is appended.
  • Capacities are [30.822]
  • que 0 req 164 (src 0 dst 5 num 0) type New capacity 9.178 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(0,5)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,5,0)[(0,164,9.178,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,5,0)[9.178,30.822,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,164)[(0,5,0,'New',9.178,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6], 1: [2, 6, 4, 7, 0, 11, 13, 12], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6]}

    VT_after_Step165_Que0_Req164.html

    Time of processing all requests 993.941, Time of current queue's turn 93.941
    Step 166Processing queue 0request 165from Node11 (11)to Node3 (3) Remain: 8.909 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 11 to 3 .
  • A new virtual link (11, 3, 0) is created for queue 0 , request 165 , from Node11 to Node3 capacity requirement 8.909 Gbps, having free capacity 31.091 Gbps.
  • New neighbour 3 is appended.
  • New virtual link (11, 3) is appended.
  • Capacities are [31.091]
  • que 0 req 165 (src 11 dst 3 num 0) type New capacity 8.909 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(11,3)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,3,0)[(0,165,8.909,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,3,0)[8.909,31.091,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,165)[(11,3,0,'New',8.909,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6], 1: [2, 6, 4, 7, 0, 11, 13, 12], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6]}

    VT_after_Step166_Que0_Req165.html

    Time of processing all requests 1000.985, Time of current queue's turn 0.985
    Step 167Processing queue 0request 166from Node1 (1)to Node10 (10) Remain: 8.812 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 1 to 10 .
  • A new virtual link (1, 10, 0) is created for queue 0 , request 166 , from Node1 to Node10 capacity requirement 8.812 Gbps, having free capacity 31.188 Gbps.
  • New neighbour 10 is appended.
  • New virtual link (1, 10) is appended.
  • Capacities are [31.188]
  • que 0 req 166 (src 1 dst 10 num 0) type New capacity 8.812 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(1,10)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(1,10,0)[(0,166,8.812,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,10,0)[8.812,31.188,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,166)[(1,10,0,'New',8.812,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6]}

    VT_after_Step167_Que0_Req166.html

    Time of processing all requests 1007.730, Time of current queue's turn 7.730
    Step 168Processing queue 0request 167from Node4 (4)to Node0 (0) Remain: 8.748 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 4 to 0 .
  • A new virtual link (4, 0, 0) is created for queue 0 , request 167 , from Node4 to Node0 capacity requirement 8.748 Gbps, having free capacity 31.252 Gbps.
  • New neighbour 0 is appended.
  • New virtual link (4, 0) is appended.
  • Capacities are [31.252]
  • que 0 req 167 (src 4 dst 0 num 0) type New capacity 8.748 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(4,0)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,0,0)[(0,167,8.748,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,0,0)[8.748,31.252,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,167)[(4,0,0,'New',8.748,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6]}

    VT_after_Step168_Que0_Req167.html

    Time of processing all requests 1015.089, Time of current queue's turn 15.089
    Step 169Processing queue 0request 168from Node2 (2)to Node0 (0) Remain: 8.515 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 2 to 0 .
  • A new virtual link (2, 0, 0) is created for queue 0 , request 168 , from Node2 to Node0 capacity requirement 8.515 Gbps, having free capacity 31.485 Gbps.
  • New neighbour 0 is appended.
  • New virtual link (2, 0) is appended.
  • Capacities are [31.485]
  • que 0 req 168 (src 2 dst 0 num 0) type New capacity 8.515 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(2,0)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,0,0)[(0,168,8.515,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,0,0)[8.515,31.485,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,168)[(2,0,0,'New',8.515,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6]}

    VT_after_Step169_Que0_Req168.html

    Time of processing all requests 1021.936, Time of current queue's turn 21.936
    Step 170Processing queue 0request 169from Node1 (1)to Node9 (9) Remain: 8.067 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 1 to 9 .
  • A new virtual link (1, 9, 0) is created for queue 0 , request 169 , from Node1 to Node9 capacity requirement 8.067 Gbps, having free capacity 31.933 Gbps.
  • New neighbour 9 is appended.
  • New virtual link (1, 9) is appended.
  • Capacities are [31.933]
  • que 0 req 169 (src 1 dst 9 num 0) type New capacity 8.067 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(1,9)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(1,9,0)[(0,169,8.067,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,9,0)[8.067,31.933,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,169)[(1,9,0,'New',8.067,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6]}

    VT_after_Step170_Que0_Req169.html

    Time of processing all requests 1028.784, Time of current queue's turn 28.784
    Step 171Processing queue 0request 170from Node3 (3)to Node7 (7) Remain: 7.901 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 3 to 7 .
  • A new virtual link (3, 7, 0) is created for queue 0 , request 170 , from Node3 to Node7 capacity requirement 7.901 Gbps, having free capacity 32.099 Gbps.
  • New neighbour 7 is appended.
  • New virtual link (3, 7) is appended.
  • Capacities are [32.099]
  • que 0 req 170 (src 3 dst 7 num 0) type New capacity 7.901 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(3,7)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,7,0)[(0,170,7.901,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,7,0)[7.901,32.099,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,170)[(3,7,0,'New',7.901,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6]}

    VT_after_Step171_Que0_Req170.html

    Time of processing all requests 1036.336, Time of current queue's turn 36.336
    Step 172Processing queue 0request 171from Node9 (9)to Node13 (13) Remain: 7.4 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 9 to 13 .
  • A new virtual link (9, 13, 0) is created for queue 0 , request 171 , from Node9 to Node13 capacity requirement 7.4 Gbps, having free capacity 32.6 Gbps.
  • New neighbour 13 is appended.
  • New virtual link (9, 13) is appended.
  • Capacities are [32.6]
  • que 0 req 171 (src 9 dst 13 num 0) type New capacity 7.400 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(9,13)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,13,0)[(0,171,7.400,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,13,0)[7.400,32.600,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,171)[(9,13,0,'New',7.400,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step172_Que0_Req171.html

    Time of processing all requests 1043.432, Time of current queue's turn 43.432
    Step 173Processing queue 0request 172from Node8 (8)to Node0 (0) Remain: 6.818 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 8 to 0 .
  • A new virtual link (8, 0, 0) is created for queue 0 , request 172 , from Node8 to Node0 capacity requirement 6.818 Gbps, having free capacity 33.182 Gbps.
  • New neighbour 0 is appended.
  • New virtual link (8, 0) is appended.
  • Capacities are [33.182]
  • que 0 req 172 (src 8 dst 0 num 0) type New capacity 6.818 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(8,0)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,0,0)[(0,172,6.818,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,0,0)[6.818,33.182,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,172)[(8,0,0,'New',6.818,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step173_Que0_Req172.html

    Time of processing all requests 1051.150, Time of current queue's turn 51.150
    Step 174Processing queue 0request 173from Node13 (13)to Node7 (7) Remain: 6.702 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 13 to 7 .
  • A new virtual link (13, 7, 0) is created for queue 0 , request 173 , from Node13 to Node7 capacity requirement 6.702 Gbps, having free capacity 33.298 Gbps.
  • New neighbour 7 is appended.
  • New virtual link (13, 7) is appended.
  • Capacities are [33.298]
  • que 0 req 173 (src 13 dst 7 num 0) type New capacity 6.702 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(13,7)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,7,0)[(0,173,6.702,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,7,0)[6.702,33.298,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,173)[(13,7,0,'New',6.702,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step174_Que0_Req173.html

    Time of processing all requests 1058.580, Time of current queue's turn 58.580
    Step 175Processing queue 0request 174from Node8 (8)to Node10 (10) Remain: 6.56 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 8 to 10 .
  • A new virtual link (8, 10, 0) is created for queue 0 , request 174 , from Node8 to Node10 capacity requirement 6.56 Gbps, having free capacity 33.44 Gbps.
  • New neighbour 10 is appended.
  • New virtual link (8, 10) is appended.
  • Capacities are [33.44]
  • que 0 req 174 (src 8 dst 10 num 0) type New capacity 6.560 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(8,10)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,10,0)[(0,174,6.560,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,10,0)[6.560,33.440,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,174)[(8,10,0,'New',6.560,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step175_Que0_Req174.html

    Time of processing all requests 1066.209, Time of current queue's turn 66.209
    Step 176Processing queue 0request 175from Node1 (1)to Node5 (5) Remain: 6.378 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 1 to 5 .
  • A new virtual link (1, 5, 0) is created for queue 0 , request 175 , from Node1 to Node5 capacity requirement 6.378 Gbps, having free capacity 33.622 Gbps.
  • New neighbour 5 is appended.
  • New virtual link (1, 5) is appended.
  • Capacities are [33.622]
  • que 0 req 175 (src 1 dst 5 num 0) type New capacity 6.378 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(1,5)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(1,5,0)[(0,175,6.378,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,5,0)[6.378,33.622,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,175)[(1,5,0,'New',6.378,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step176_Que0_Req175.html

    Time of processing all requests 1073.626, Time of current queue's turn 73.626
    Step 177Processing queue 0request 176from Node12 (12)to Node5 (5) Remain: 6.217 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 12 to 5 .
  • A new virtual link (12, 5, 0) is created for queue 0 , request 176 , from Node12 to Node5 capacity requirement 6.217 Gbps, having free capacity 33.783 Gbps.
  • New neighbour 5 is appended.
  • New virtual link (12, 5) is appended.
  • Capacities are [33.783]
  • que 0 req 176 (src 12 dst 5 num 0) type New capacity 6.217 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(12,5)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(12,5,0)[(0,176,6.217,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,5,0)[6.217,33.783,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,176)[(12,5,0,'New',6.217,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step177_Que0_Req176.html

    Time of processing all requests 1081.255, Time of current queue's turn 81.255
    Step 178Processing queue 0request 177from Node11 (11)to Node8 (8) Remain: 6.041 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 11 to 8 .
  • A new virtual link (11, 8, 0) is created for queue 0 , request 177 , from Node11 to Node8 capacity requirement 6.041 Gbps, having free capacity 33.959 Gbps.
  • New neighbour 8 is appended.
  • New virtual link (11, 8) is appended.
  • Capacities are [33.959]
  • que 0 req 177 (src 11 dst 8 num 0) type New capacity 6.041 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(11,8)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,8,0)[(0,177,6.041,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,8,0)[6.041,33.959,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,177)[(11,8,0,'New',6.041,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step178_Que0_Req177.html

    Time of processing all requests 1088.657, Time of current queue's turn 88.657
    Step 179Processing queue 0request 178from Node1 (1)to Node8 (8) Remain: 5.971 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 1 to 8 .
  • A new virtual link (1, 8, 0) is created for queue 0 , request 178 , from Node1 to Node8 capacity requirement 5.971 Gbps, having free capacity 34.029 Gbps.
  • New neighbour 8 is appended.
  • New virtual link (1, 8) is appended.
  • Capacities are [34.029]
  • que 0 req 178 (src 1 dst 8 num 0) type New capacity 5.971 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(1,8)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(1,8,0)[(0,178,5.971,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,8,0)[5.971,34.029,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,178)[(1,8,0,'New',5.971,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step179_Que0_Req178.html

    Time of processing all requests 1095.851, Time of current queue's turn 95.851
    Step 180Processing queue 0request 179from Node7 (7)to Node4 (4) Remain: 5.474 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 7 to 4 .
  • A new virtual link (7, 4, 0) is created for queue 0 , request 179 , from Node7 to Node4 capacity requirement 5.474 Gbps, having free capacity 34.526 Gbps.
  • New neighbour 4 is appended.
  • New virtual link (7, 4) is appended.
  • Capacities are [34.526]
  • que 0 req 179 (src 7 dst 4 num 0) type New capacity 5.474 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(7,4)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,4,0)[(0,179,5.474,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,4,0)[5.474,34.526,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,179)[(7,4,0,'New',5.474,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step180_Que0_Req179.html

    Time of processing all requests 1103.301, Time of current queue's turn 3.301
    Step 181Processing queue 0request 180from Node3 (3)to Node6 (6) Remain: 5.338 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 3 to 6 .
  • A new virtual link (3, 6, 0) is created for queue 0 , request 180 , from Node3 to Node6 capacity requirement 5.338 Gbps, having free capacity 34.662 Gbps.
  • New neighbour 6 is appended.
  • New virtual link (3, 6) is appended.
  • Capacities are [34.662]
  • que 0 req 180 (src 3 dst 6 num 0) type New capacity 5.338 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(3,6)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,6,0)[(0,180,5.338,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,6,0)[5.338,34.662,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,180)[(3,6,0,'New',5.338,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step181_Que0_Req180.html

    Time of processing all requests 1111.020, Time of current queue's turn 11.020
    Step 182Processing queue 0request 181from Node1 (1)to Node3 (3) Remain: 5.227 Gbps to be routed.
  • A new virtual link will be created since the requirement is routed using Direct Bypass.
  • Adding a new virtual link from 1 to 3 .
  • A new virtual link (1, 3, 0) is created for queue 0 , request 181 , from Node1 to Node3 capacity requirement 5.227 Gbps, having free capacity 34.773 Gbps.
  • New neighbour 3 is appended.
  • New virtual link (1, 3) is appended.
  • Capacities are [34.773]
  • que 0 req 181 (src 1 dst 3 num 0) type New capacity 5.227 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    New entry(1,3)[0]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(1,3,0)[(0,181,5.227,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,3,0)[5.227,34.773,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(0,181)[(1,3,0,'New',5.227,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step182_Que0_Req181.html

    Time of processing all requests 1118.371, Time of current queue's turn 18.371

    The Virtual Topology

    The final Virtual Topology


    Routing traffic requests of the single queue over the Virtual Topology (a.k.a. Adding requests to the Virtual Topology)
    Step numberQueueRequestFromTo Required/RemainActionsOutcomes Current Virtual TopologyCurrent request processing start (msec)
    Step 183Processing queue 1request 0from Node0 (0)to Node12 (12) Remain 34.926 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 34.926 Gbps, to route the capacity requirement from Node0 to Node12
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 34.926 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 8.748 31.252 1
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 6.818 33.182 1
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 6.041 33.959 1
    1 8 0 5.971 34.029 1
    7 4 0 5.474 34.526 1
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
  • All paths None .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 34.926
  • Adding a new virtual link from 0 to 12 .
  • A new virtual link (0, 12, 1) is created for queue 1 , request 0 , from Node0 to Node12 capacity requirement 34.926 Gbps, having free capacity 5.074 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 0 → 12 are = [28.944]
  • Capacities are [28.944]
  • que 1 req 0 (src 0 dst 12 num 1) type New capacity 34.926 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(0,12)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,12,1)[(1,0,34.926,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,12,1)[34.926,5.074,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,0)[(0,12,1,'New',34.926,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step183_Que1_Req0.html

    Time of processing all requests 0.102, Time of current queue's turn 0.102
    Step 184Processing queue 1request 1from Node13 (13)to Node8 (8) Remain 34.82 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 34.82 Gbps, to route the capacity requirement from Node13 to Node8
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 34.82 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 8.748 31.252 1
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 6.818 33.182 1
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 6.041 33.959 1
    1 8 0 5.971 34.029 1
    7 4 0 5.474 34.526 1
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
  • All paths None .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 34.82
  • Adding a new virtual link from 13 to 8 .
  • A new virtual link (13, 8, 1) is created for queue 1 , request 1 , from Node13 to Node8 capacity requirement 34.82 Gbps, having free capacity 5.18 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 13 → 8 are = [14.785]
  • Capacities are [14.785]
  • que 1 req 1 (src 13 dst 8 num 1) type New capacity 34.820 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(13,8)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,8,1)[(1,1,34.820,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,8,1)[34.820,5.180,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,1)[(13,8,1,'New',34.820,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step184_Que1_Req1.html

    Time of processing all requests 12.385, Time of current queue's turn 12.385
    Step 185Processing queue 1request 2from Node13 (13)to Node9 (9) Remain 34.296 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 34.296 Gbps, to route the capacity requirement from Node13 to Node9
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 34.296 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 8.748 31.252 1
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 6.818 33.182 1
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 6.041 33.959 1
    1 8 0 5.971 34.029 1
    7 4 0 5.474 34.526 1
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    7 4
    3 6
    1 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    7 4 0 34.526
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {7: [4], 3: [6], 1: [3]}
  • Source: 13
  • Destination: 9
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 34.296
  • Adding a new virtual link from 13 to 9 .
  • A new virtual link (13, 9, 1) is created for queue 1 , request 2 , from Node13 to Node9 capacity requirement 34.296 Gbps, having free capacity 5.704 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 13 → 9 are = [13.833]
  • Capacities are [13.833]
  • que 1 req 2 (src 13 dst 9 num 1) type New capacity 34.296 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(13,9)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,9,1)[(1,2,34.296,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,9,1)[34.296,5.704,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,2)[(13,9,1,'New',34.296,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step185_Que1_Req2.html

    Time of processing all requests 21.414, Time of current queue's turn 21.414
    Step 186Processing queue 1request 3from Node8 (8)to Node4 (4) Remain 34.291 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 34.291 Gbps, to route the capacity requirement from Node8 to Node4
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 34.291 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 8.748 31.252 1
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 6.818 33.182 1
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 6.041 33.959 1
    1 8 0 5.971 34.029 1
    7 4 0 5.474 34.526 1
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    7 4
    3 6
    1 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    7 4 0 34.526
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {7: [4], 3: [6], 1: [3]}
  • Source: 8
  • Destination: 4
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 34.291
  • Adding a new virtual link from 8 to 4 .
  • A new virtual link (8, 4, 1) is created for queue 1 , request 3 , from Node8 to Node4 capacity requirement 34.291 Gbps, having free capacity 5.709 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 8 → 4 are = [17.931]
  • Capacities are [17.931]
  • que 1 req 3 (src 8 dst 4 num 1) type New capacity 34.291 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(8,4)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,4,1)[(1,3,34.291,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,4,1)[34.291,5.709,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,3)[(8,4,1,'New',34.291,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step186_Que1_Req3.html

    Time of processing all requests 30.811, Time of current queue's turn 30.811
    Step 187Processing queue 1request 4from Node7 (7)to Node11 (11) Remain 34.015 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 34.015 Gbps, to route the capacity requirement from Node7 to Node11
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 34.015 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 8.748 31.252 1
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 6.818 33.182 1
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 6.041 33.959 1
    1 8 0 5.971 34.029 1
    7 4 0 5.474 34.526 1
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    1 8 3
    7 4
    3 6
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    1 8 0 34.029
    7 4 0 34.526
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {1: [8, 3], 7: [4], 3: [6]}
  • Source: 7
  • Destination: 11
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 34.015
  • Adding a new virtual link from 7 to 11 .
  • A new virtual link (7, 11, 1) is created for queue 1 , request 4 , from Node7 to Node11 capacity requirement 34.015 Gbps, having free capacity 5.985 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 7 → 11 are = [23.29]
  • Capacities are [23.29]
  • que 1 req 4 (src 7 dst 11 num 1) type New capacity 34.015 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(7,11)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,11,1)[(1,4,34.015,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,11,1)[34.015,5.985,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,4)[(7,11,1,'New',34.015,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step187_Que1_Req4.html

    Time of processing all requests 42.838, Time of current queue's turn 42.838
    Step 188Processing queue 1request 5from Node12 (12)to Node3 (3) Remain 32.899 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 32.899 Gbps, to route the capacity requirement from Node12 to Node3
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 32.899 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 8.748 31.252 1
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 6.818 33.182 1
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 6.041 33.959 1
    1 8 0 5.971 34.029 1
    7 4 0 5.474 34.526 1
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    8 0 10
    13 7
    1 5 8 3
    12 5
    11 8
    7 4
    3 6
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    8 0 0 33.182
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    11 8 0 33.959
    1 8 0 34.029
    7 4 0 34.526
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {8: [0, 10], 13: [7], 1: [5, 8, 3], 12: [5], 11: [8], 7: [4], 3: [6]}
  • Source: 12
  • Destination: 3
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 32.899
  • Adding a new virtual link from 12 to 3 .
  • A new virtual link (12, 3, 1) is created for queue 1 , request 5 , from Node12 to Node3 capacity requirement 32.899 Gbps, having free capacity 7.101 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 12 → 3 are = [17.647]
  • Capacities are [17.647]
  • que 1 req 5 (src 12 dst 3 num 1) type New capacity 32.899 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(12,3)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(12,3,1)[(1,5,32.899,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,3,1)[32.899,7.101,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,5)[(12,3,1,'New',32.899,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step188_Que1_Req5.html

    Time of processing all requests 52.149, Time of current queue's turn 52.149
    Step 189Processing queue 1request 6from Node10 (10)to Node4 (4) Remain 32.788 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 32.788 Gbps, to route the capacity requirement from Node10 to Node4
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 32.788 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 8.748 31.252 1
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 6.818 33.182 1
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 6.041 33.959 1
    1 8 0 5.971 34.029 1
    7 4 0 5.474 34.526 1
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    8 0 10
    13 7
    1 5 8 3
    12 5
    11 8
    7 4
    3 6
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    8 0 0 33.182
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    11 8 0 33.959
    1 8 0 34.029
    7 4 0 34.526
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {8: [0, 10], 13: [7], 1: [5, 8, 3], 12: [5], 11: [8], 7: [4], 3: [6]}
  • Source: 10
  • Destination: 4
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 32.788
  • Adding a new virtual link from 10 to 4 .
  • A new virtual link (10, 4, 1) is created for queue 1 , request 6 , from Node10 to Node4 capacity requirement 32.788 Gbps, having free capacity 7.212 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 10 → 4 are = [6.59]
  • Capacities are [6.59]
  • que 1 req 6 (src 10 dst 4 num 1) type New capacity 32.788 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(10,4)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,4,1)[(1,6,32.788,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,4,1)[32.788,7.212,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,6)[(10,4,1,'New',32.788,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step189_Que1_Req6.html

    Time of processing all requests 64.616, Time of current queue's turn 64.616
    Step 190Processing queue 1request 7from Node8 (8)to Node6 (6) Remain 32.642 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 32.642 Gbps, to route the capacity requirement from Node8 to Node6
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 32.642 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 8.748 31.252 1
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 6.818 33.182 1
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 6.041 33.959 1
    1 8 0 5.971 34.029 1
    7 4 0 5.474 34.526 1
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    8 0 10
    13 7
    1 5 8 3
    12 5
    11 8
    7 4
    3 6
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    8 0 0 33.182
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    11 8 0 33.959
    1 8 0 34.029
    7 4 0 34.526
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {8: [0, 10], 13: [7], 1: [5, 8, 3], 12: [5], 11: [8], 7: [4], 3: [6]}
  • Source: 8
  • Destination: 6
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 32.642
  • Adding a new virtual link from 8 to 6 .
  • A new virtual link (8, 6, 1) is created for queue 1 , request 7 , from Node8 to Node6 capacity requirement 32.642 Gbps, having free capacity 7.358 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 8 → 6 are = [30.693]
  • Capacities are [30.693]
  • que 1 req 7 (src 8 dst 6 num 1) type New capacity 32.642 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(8,6)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,6,1)[(1,7,32.642,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,6,1)[32.642,7.358,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,7)[(8,6,1,'New',32.642,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step190_Que1_Req7.html

    Time of processing all requests 73.693, Time of current queue's turn 73.693
    Step 191Processing queue 1request 8from Node10 (10)to Node8 (8) Remain 32.479 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 32.479 Gbps, to route the capacity requirement from Node10 to Node8
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 32.479 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 8.748 31.252 1
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 6.818 33.182 1
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 6.041 33.959 1
    1 8 0 5.971 34.029 1
    7 4 0 5.474 34.526 1
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 13
    8 0 10
    13 7
    1 5 8 3
    12 5
    11 8
    7 4
    3 6
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 13 0 32.6
    8 0 0 33.182
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    11 8 0 33.959
    1 8 0 34.029
    7 4 0 34.526
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {9: [13], 8: [0, 10], 13: [7], 1: [5, 8, 3], 12: [5], 11: [8], 7: [4], 3: [6]}
  • Source: 10
  • Destination: 8
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 32.479
  • Adding a new virtual link from 10 to 8 .
  • A new virtual link (10, 8, 1) is created for queue 1 , request 8 , from Node10 to Node8 capacity requirement 32.479 Gbps, having free capacity 7.521 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 10 → 8 are = [15.145]
  • Capacities are [15.145]
  • que 1 req 8 (src 10 dst 8 num 1) type New capacity 32.479 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(10,8)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,8,1)[(1,8,32.479,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,8,1)[32.479,7.521,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,8)[(10,8,1,'New',32.479,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step191_Que1_Req8.html

    Time of processing all requests 86.445, Time of current queue's turn 86.445
    Step 192Processing queue 1request 9from Node11 (11)to Node0 (0) Remain 32.374 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 32.374 Gbps, to route the capacity requirement from Node11 to Node0
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 32.374 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 8.748 31.252 1
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 6.818 33.182 1
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 6.041 33.959 1
    1 8 0 5.971 34.029 1
    7 4 0 5.474 34.526 1
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 13
    8 0 10
    13 7
    1 5 8 3
    12 5
    11 8
    7 4
    3 6
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 13 0 32.6
    8 0 0 33.182
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    11 8 0 33.959
    1 8 0 34.029
    7 4 0 34.526
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {9: [13], 8: [0, 10], 13: [7], 1: [5, 8, 3], 12: [5], 11: [8], 7: [4], 3: [6]}
  • Source: 11
  • Destination: 0
  • All paths [11, 8, 0] .
  • Processing path [11, 8, 0]
  • Path2links [[11, 8], [8, 0]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[11, 8], [8, 0]]
  • Subtract the utilised capacity from the Link's [11, 8] free capacity.
  • Update value is -32.374
  • Updated Virtual Link's (11,8,0) free capacity to 1.585.
  • que 1 req 9 (src 11 dst 8 num 0) type Grm capacity 32.374 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 9 VirtualLinkID: 178 (src: 11 dst: 8 ), Required Capacity: 32.374 Free Capacity (on the graph): 1.585 Free Capacity (on the corresponding array:) 1.585 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [8, 0] free capacity.
  • Update value is -32.374
  • Updated Virtual Link's (8,0,0) free capacity to 0.808.
  • que 1 req 9 (src 8 dst 0 num 0) type Grm capacity 32.374 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 9 VirtualLinkID: 173 (src: 8 dst: 0 ), Required Capacity: 32.374 Free Capacity (on the graph): 0.808 Free Capacity (on the corresponding array:) 0.808 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(11,8,0)[(0,177,6.041,'New'),(1,9,32.374,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,8,0)[38.415,1.585,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,9)[(11,8,0,'Grm',32.374,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,0,0)[(0,172,6.818,'New'),(1,9,32.374,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,0,0)[39.192,0.808,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,9)[(11,8,0,'Grm',32.374,0,0),(8,0,0,'Grm',32.374,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step192_Que1_Req9.html

    Time of processing all requests 95.668, Time of current queue's turn 95.668
    Step 193Processing queue 1request 10from Node2 (2)to Node12 (12) Remain 32.246 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 32.246 Gbps, to route the capacity requirement from Node2 to Node12
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 32.246 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 8.748 31.252 1
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 5.474 34.526 1
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 13
    13 7
    8 10
    1 5 8 3
    12 5
    7 4
    3 6
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    7 4 0 34.526
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {9: [13], 13: [7], 8: [10], 1: [5, 8, 3], 12: [5], 7: [4], 3: [6]}
  • Source: 2
  • Destination: 12
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 32.246
  • Adding a new virtual link from 2 to 12 .
  • A new virtual link (2, 12, 1) is created for queue 1 , request 10 , from Node2 to Node12 capacity requirement 32.246 Gbps, having free capacity 7.754 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 2 → 12 are = [13.044]
  • Capacities are [13.044]
  • que 1 req 10 (src 2 dst 12 num 1) type New capacity 32.246 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(2,12)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,12,1)[(1,10,32.246,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,12,1)[32.246,7.754,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,10)[(2,12,1,'New',32.246,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step193_Que1_Req10.html

    Time of processing all requests 112.180, Time of current queue's turn 12.180
    Step 194Processing queue 1request 11from Node8 (8)to Node11 (11) Remain 31.492 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 31.492 Gbps, to route the capacity requirement from Node8 to Node11
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 31.492 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 8.748 31.252 1
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 5.474 34.526 1
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    1 9 5 8 3
    3 7 6
    9 13
    13 7
    8 10
    12 5
    7 4
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    1 9 0 31.933
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    7 4 0 34.526
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {1: [9, 5, 8, 3], 3: [7, 6], 9: [13], 13: [7], 8: [10], 12: [5], 7: [4]}
  • Source: 8
  • Destination: 11
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 31.492
  • Adding a new virtual link from 8 to 11 .
  • A new virtual link (8, 11, 1) is created for queue 1 , request 11 , from Node8 to Node11 capacity requirement 31.492 Gbps, having free capacity 8.508 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 8 → 11 are = [11.414]
  • Capacities are [11.414]
  • que 1 req 11 (src 8 dst 11 num 1) type New capacity 31.492 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(8,11)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,11,1)[(1,11,31.492,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,11,1)[31.492,8.508,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,11)[(8,11,1,'New',31.492,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step194_Que1_Req11.html

    Time of processing all requests 121.349, Time of current queue's turn 21.349
    Step 195Processing queue 1request 12from Node7 (7)to Node0 (0) Remain 31.178 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 31.178 Gbps, to route the capacity requirement from Node7 to Node0
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 31.178 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 8.748 31.252 1
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 5.474 34.526 1
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    1 10 9 5 8 3
    4 0
    2 0
    3 7 6
    9 13
    13 7
    8 10
    12 5
    7 4
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    1 10 0 31.188
    4 0 0 31.252
    2 0 0 31.485
    1 9 0 31.933
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    7 4 0 34.526
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {1: [10, 9, 5, 8, 3], 4: [0], 2: [0], 3: [7, 6], 9: [13], 13: [7], 8: [10], 12: [5], 7: [4]}
  • Source: 7
  • Destination: 0
  • All paths [7, 4, 0] .
  • Processing path [7, 4, 0]
  • Path2links [[7, 4], [4, 0]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[7, 4], [4, 0]]
  • Subtract the utilised capacity from the Link's [7, 4] free capacity.
  • Update value is -31.178
  • Updated Virtual Link's (7,4,0) free capacity to 3.348.
  • que 1 req 12 (src 7 dst 4 num 0) type Grm capacity 31.178 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 12 VirtualLinkID: 180 (src: 7 dst: 4 ), Required Capacity: 31.178 Free Capacity (on the graph): 3.348 Free Capacity (on the corresponding array:) 3.348 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [4, 0] free capacity.
  • Update value is -31.178
  • Updated Virtual Link's (4,0,0) free capacity to 0.074.
  • que 1 req 12 (src 4 dst 0 num 0) type Grm capacity 31.178 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 12 VirtualLinkID: 168 (src: 4 dst: 0 ), Required Capacity: 31.178 Free Capacity (on the graph): 0.074 Free Capacity (on the corresponding array:) 0.074 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(7,4,0)[(0,179,5.474,'New'),(1,12,31.178,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,4,0)[36.652,3.348,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,12)[(7,4,0,'Grm',31.178,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(4,0,0)[(0,167,8.748,'New'),(1,12,31.178,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,0,0)[39.926,0.074,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,12)[(7,4,0,'Grm',31.178,0,0),(4,0,0,'Grm',31.178,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step195_Que1_Req12.html

    Time of processing all requests 134.037, Time of current queue's turn 34.037
    Step 196Processing queue 1request 13from Node0 (0)to Node4 (4) Remain 31.065 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 31.065 Gbps, to route the capacity requirement from Node0 to Node4
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 31.065 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    11 3
    1 10 9 5 8 3
    2 0
    3 7 6
    9 13
    13 7
    8 10
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    11 3 0 31.091
    1 10 0 31.188
    2 0 0 31.485
    1 9 0 31.933
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {11: [3], 1: [10, 9, 5, 8, 3], 2: [0], 3: [7, 6], 9: [13], 13: [7], 8: [10], 12: [5]}
  • Source: 0
  • Destination: 4
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 31.065
  • Adding a new virtual link from 0 to 4 .
  • A new virtual link (0, 4, 1) is created for queue 1 , request 13 , from Node0 to Node4 capacity requirement 31.065 Gbps, having free capacity 8.935 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 0 → 4 are = [22.279]
  • Capacities are [22.279]
  • que 1 req 13 (src 0 dst 4 num 1) type New capacity 31.065 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(0,4)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,4,1)[(1,13,31.065,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,4,1)[31.065,8.935,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,13)[(0,4,1,'New',31.065,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step196_Que1_Req13.html

    Time of processing all requests 147.545, Time of current queue's turn 47.545
    Step 197Processing queue 1request 14from Node4 (4)to Node3 (3) Remain 30.752 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 30.752 Gbps, to route the capacity requirement from Node4 to Node3
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 30.752 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 6 13
    0 5
    11 3
    1 10 9 5 8 3
    2 0
    3 7 6
    13 7
    8 10
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 6 0 30.785
    0 5 0 30.822
    11 3 0 31.091
    1 10 0 31.188
    2 0 0 31.485
    1 9 0 31.933
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {9: [6, 13], 0: [5], 11: [3], 1: [10, 9, 5, 8, 3], 2: [0], 3: [7, 6], 13: [7], 8: [10], 12: [5]}
  • Source: 4
  • Destination: 3
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 30.752
  • Adding a new virtual link from 4 to 3 .
  • A new virtual link (4, 3, 1) is created for queue 1 , request 14 , from Node4 to Node3 capacity requirement 30.752 Gbps, having free capacity 9.248 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 4 → 3 are = [11.442]
  • Capacities are [11.442]
  • que 1 req 14 (src 4 dst 3 num 1) type New capacity 30.752 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(4,3)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,3,1)[(1,14,30.752,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,3,1)[30.752,9.248,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,14)[(4,3,1,'New',30.752,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step197_Que1_Req14.html

    Time of processing all requests 156.658, Time of current queue's turn 56.658
    Step 198Processing queue 1request 15from Node5 (5)to Node3 (3) Remain 30.65 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 30.65 Gbps, to route the capacity requirement from Node5 to Node3
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 30.65 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    8 6 10
    12 11 5
    9 6 13
    0 5
    11 3
    1 10 9 5 8 3
    2 0
    3 7 6
    13 7
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    8 6 0 30.693
    12 11 0 30.698
    9 6 0 30.785
    0 5 0 30.822
    11 3 0 31.091
    1 10 0 31.188
    2 0 0 31.485
    1 9 0 31.933
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {8: [6, 10], 12: [11, 5], 9: [6, 13], 0: [5], 11: [3], 1: [10, 9, 5, 8, 3], 2: [0], 3: [7, 6], 13: [7]}
  • Source: 5
  • Destination: 3
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 30.65
  • Adding a new virtual link from 5 to 3 .
  • A new virtual link (5, 3, 1) is created for queue 1 , request 15 , from Node5 to Node3 capacity requirement 30.65 Gbps, having free capacity 9.35 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 5 → 3 are = [12.62]
  • Capacities are [12.62]
  • que 1 req 15 (src 5 dst 3 num 1) type New capacity 30.650 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(5,3)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,3,1)[(1,15,30.650,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,3,1)[30.650,9.350,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,15)[(5,3,1,'New',30.650,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step198_Que1_Req15.html

    Time of processing all requests 169.525, Time of current queue's turn 69.525
    Step 199Processing queue 1request 16from Node9 (9)to Node0 (0) Remain 30.483 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 30.483 Gbps, to route the capacity requirement from Node9 to Node0
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 30.483 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 9.403 30.597 1
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 8.515 31.485 1
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 2 6 13
    8 6 10
    12 11 5
    0 5
    11 3
    1 10 9 5 8 3
    2 0
    3 7 6
    13 7
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 2 0 30.597
    8 6 0 30.693
    12 11 0 30.698
    9 6 0 30.785
    0 5 0 30.822
    11 3 0 31.091
    1 10 0 31.188
    2 0 0 31.485
    1 9 0 31.933
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {9: [2, 6, 13], 8: [6, 10], 12: [11, 5], 0: [5], 11: [3], 1: [10, 9, 5, 8, 3], 2: [0], 3: [7, 6], 13: [7]}
  • Source: 9
  • Destination: 0
  • All paths [9, 2, 0] .
  • Processing path [9, 2, 0]
  • Path2links [[9, 2], [2, 0]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[9, 2], [2, 0]]
  • Subtract the utilised capacity from the Link's [9, 2] free capacity.
  • Update value is -30.483
  • Updated Virtual Link's (9,2,0) free capacity to 0.114.
  • que 1 req 16 (src 9 dst 2 num 0) type Grm capacity 30.483 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 16 VirtualLinkID: 161 (src: 9 dst: 2 ), Required Capacity: 30.483 Free Capacity (on the graph): 0.114 Free Capacity (on the corresponding array:) 0.114 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [2, 0] free capacity.
  • Update value is -30.483
  • Updated Virtual Link's (2,0,0) free capacity to 1.002.
  • que 1 req 16 (src 2 dst 0 num 0) type Grm capacity 30.483 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 16 VirtualLinkID: 169 (src: 2 dst: 0 ), Required Capacity: 30.483 Free Capacity (on the graph): 1.002 Free Capacity (on the corresponding array:) 1.002 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(9,2,0)[(0,160,9.403,'New'),(1,16,30.483,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,2,0)[39.886,0.114,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,16)[(9,2,0,'Grm',30.483,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(2,0,0)[(0,168,8.515,'New'),(1,16,30.483,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,0,0)[38.998,1.002,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,16)[(9,2,0,'Grm',30.483,0,0),(2,0,0,'Grm',30.483,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step199_Que1_Req16.html

    Time of processing all requests 179.285, Time of current queue's turn 79.285
    Step 200Processing queue 1request 17from Node3 (3)to Node13 (13) Remain 30.282 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 30.282 Gbps, to route the capacity requirement from Node3 to Node13
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 30.282 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 10 8
    8 6 10
    12 11 5
    9 6 13
    0 5
    11 3
    1 10 9 5 8 3
    3 7 6
    13 7
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 10 0 30.362
    2 8 0 30.404
    8 6 0 30.693
    12 11 0 30.698
    9 6 0 30.785
    0 5 0 30.822
    11 3 0 31.091
    1 10 0 31.188
    1 9 0 31.933
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {2: [10, 8], 8: [6, 10], 12: [11, 5], 9: [6, 13], 0: [5], 11: [3], 1: [10, 9, 5, 8, 3], 3: [7, 6], 13: [7]}
  • Source: 3
  • Destination: 13
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 30.282
  • Adding a new virtual link from 3 to 13 .
  • A new virtual link (3, 13, 1) is created for queue 1 , request 17 , from Node3 to Node13 capacity requirement 30.282 Gbps, having free capacity 9.718 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 3 → 13 are = [18.222]
  • Capacities are [18.222]
  • que 1 req 17 (src 3 dst 13 num 1) type New capacity 30.282 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(3,13)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,13,1)[(1,17,30.282,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,13,1)[30.282,9.718,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,17)[(3,13,1,'New',30.282,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step200_Que1_Req17.html

    Time of processing all requests 196.608, Time of current queue's turn 96.608
    Step 201Processing queue 1request 18from Node8 (8)to Node1 (1) Remain 30.205 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 30.205 Gbps, to route the capacity requirement from Node8 to Node1
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 30.205 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    6 11
    2 10 8
    8 6 10
    12 11 5
    9 6 13
    0 5
    11 3
    1 10 9 5 8 3
    3 7 6
    13 7
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    6 11 0 30.225
    2 10 0 30.362
    2 8 0 30.404
    8 6 0 30.693
    12 11 0 30.698
    9 6 0 30.785
    0 5 0 30.822
    11 3 0 31.091
    1 10 0 31.188
    1 9 0 31.933
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {6: [11], 2: [10, 8], 8: [6, 10], 12: [11, 5], 9: [6, 13], 0: [5], 11: [3], 1: [10, 9, 5, 8, 3], 3: [7, 6], 13: [7]}
  • Source: 8
  • Destination: 1
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 30.205
  • Adding a new virtual link from 8 to 1 .
  • A new virtual link (8, 1, 1) is created for queue 1 , request 18 , from Node8 to Node1 capacity requirement 30.205 Gbps, having free capacity 9.795 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 8 → 1 are = [24.593]
  • Capacities are [24.593]
  • que 1 req 18 (src 8 dst 1 num 1) type New capacity 30.205 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(8,1)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,1,1)[(1,18,30.205,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,1,1)[30.205,9.795,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,18)[(8,1,1,'New',30.205,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step201_Que1_Req18.html

    Time of processing all requests 206.049, Time of current queue's turn 6.049
    Step 202Processing queue 1request 19from Node12 (12)to Node11 (11) Remain 30.118 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 30.118 Gbps, to route the capacity requirement from Node12 to Node11
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 30.118 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 9.302 30.698 1
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    6 11
    2 10 8
    8 6 10
    12 11 5
    9 6 13
    0 5
    11 3
    1 10 9 5 8 3
    3 7 6
    13 7
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    6 11 0 30.225
    2 10 0 30.362
    2 8 0 30.404
    8 6 0 30.693
    12 11 0 30.698
    9 6 0 30.785
    0 5 0 30.822
    11 3 0 31.091
    1 10 0 31.188
    1 9 0 31.933
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {6: [11], 2: [10, 8], 8: [6, 10], 12: [11, 5], 9: [6, 13], 0: [5], 11: [3], 1: [10, 9, 5, 8, 3], 3: [7, 6], 13: [7]}
  • Source: 12
  • Destination: 11
  • All paths [12, 11] .
  • Processing path [12, 11]
  • Path2links [[12, 11]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[12, 11]]
  • Subtract the utilised capacity from the Link's [12, 11] free capacity.
  • Update value is -30.118
  • Updated Virtual Link's (12,11,0) free capacity to 0.580.
  • que 1 req 19 (src 12 dst 11 num 0) type Grm capacity 30.118 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 19 VirtualLinkID: 163 (src: 12 dst: 11 ), Required Capacity: 30.118 Free Capacity (on the graph): 0.58 Free Capacity (on the corresponding array:) 0.58 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,11,0)[(0,162,9.302,'New'),(1,19,30.118,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,11,0)[39.420,0.580,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,19)[(12,11,0,'Grm',30.118,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step202_Que1_Req19.html

    Time of processing all requests 219.037, Time of current queue's turn 19.037
    Step 203Processing queue 1request 20from Node7 (7)to Node9 (9) Remain 30.096 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 30.096 Gbps, to route the capacity requirement from Node7 to Node9
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 30.096 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    6 11
    2 10 8
    8 6 10
    9 6 13
    0 5
    11 3
    1 10 9 5 8 3
    3 7 6
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    6 11 0 30.225
    2 10 0 30.362
    2 8 0 30.404
    8 6 0 30.693
    9 6 0 30.785
    0 5 0 30.822
    11 3 0 31.091
    1 10 0 31.188
    1 9 0 31.933
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {6: [11], 2: [10, 8], 8: [6, 10], 9: [6, 13], 0: [5], 11: [3], 1: [10, 9, 5, 8, 3], 3: [7, 6], 13: [7], 12: [5]}
  • Source: 7
  • Destination: 9
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 30.096
  • Adding a new virtual link from 7 to 9 .
  • A new virtual link (7, 9, 1) is created for queue 1 , request 20 , from Node7 to Node9 capacity requirement 30.096 Gbps, having free capacity 9.904 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 7 → 9 are = [10.995]
  • Capacities are [10.995]
  • que 1 req 20 (src 7 dst 9 num 1) type New capacity 30.096 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(7,9)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,9,1)[(1,20,30.096,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,9,1)[30.096,9.904,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,20)[(7,9,1,'New',30.096,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step203_Que1_Req20.html

    Time of processing all requests 228.424, Time of current queue's turn 28.424
    Step 204Processing queue 1request 21from Node2 (2)to Node13 (13) Remain 30.028 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 30.028 Gbps, to route the capacity requirement from Node2 to Node13
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 30.028 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 9.942 30.058 1
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 9.596 30.404 1
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    8 13 6 10
    1 12 10 9 5 8 3
    6 11
    2 10 8
    9 6 13
    0 5
    11 3
    3 7 6
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    8 13 0 30.058
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    2 8 0 30.404
    8 6 0 30.693
    9 6 0 30.785
    0 5 0 30.822
    11 3 0 31.091
    1 10 0 31.188
    1 9 0 31.933
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {8: [13, 6, 10], 1: [12, 10, 9, 5, 8, 3], 6: [11], 2: [10, 8], 9: [6, 13], 0: [5], 11: [3], 3: [7, 6], 13: [7], 12: [5]}
  • Source: 2
  • Destination: 13
  • All paths [2, 8, 13] .
  • Processing path [2, 8, 13]
  • Path2links [[2, 8], [8, 13]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[2, 8], [8, 13]]
  • Subtract the utilised capacity from the Link's [2, 8] free capacity.
  • Update value is -30.028
  • Updated Virtual Link's (2,8,0) free capacity to 0.376.
  • que 1 req 21 (src 2 dst 8 num 0) type Grm capacity 30.028 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 21 VirtualLinkID: 160 (src: 2 dst: 8 ), Required Capacity: 30.028 Free Capacity (on the graph): 0.376 Free Capacity (on the corresponding array:) 0.376 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [8, 13] free capacity.
  • Update value is -30.028
  • Updated Virtual Link's (8,13,0) free capacity to 0.030.
  • que 1 req 21 (src 8 dst 13 num 0) type Grm capacity 30.028 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 21 VirtualLinkID: 156 (src: 8 dst: 13 ), Required Capacity: 30.028 Free Capacity (on the graph): 0.03 Free Capacity (on the corresponding array:) 0.03 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(2,8,0)[(0,159,9.596,'New'),(1,21,30.028,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,8,0)[39.624,0.376,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,21)[(2,8,0,'Grm',30.028,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,13,0)[(0,155,9.942,'New'),(1,21,30.028,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,13,0)[39.970,0.030,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,21)[(2,8,0,'Grm',30.028,0,0),(8,13,0,'Grm',30.028,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step204_Que1_Req21.html

    Time of processing all requests 241.435, Time of current queue's turn 41.435
    Step 205Processing queue 1request 22from Node11 (11)to Node6 (6) Remain 29.924 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 29.924 Gbps, to route the capacity requirement from Node11 to Node6
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 29.924 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 8.909 31.091 1
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 5.338 34.662 1
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    1 12 10 9 5 8 3
    6 11
    2 10
    8 6 10
    9 6 13
    0 5
    11 3
    3 7 6
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    9 6 0 30.785
    0 5 0 30.822
    11 3 0 31.091
    1 10 0 31.188
    1 9 0 31.933
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    3 6 0 34.662
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {1: [12, 10, 9, 5, 8, 3], 6: [11], 2: [10], 8: [6, 10], 9: [6, 13], 0: [5], 11: [3], 3: [7, 6], 13: [7], 12: [5]}
  • Source: 11
  • Destination: 6
  • All paths [11, 3, 6] .
  • Processing path [11, 3, 6]
  • Path2links [[11, 3], [3, 6]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[11, 3], [3, 6]]
  • Subtract the utilised capacity from the Link's [11, 3] free capacity.
  • Update value is -29.924
  • Updated Virtual Link's (11,3,0) free capacity to 1.167.
  • que 1 req 22 (src 11 dst 3 num 0) type Grm capacity 29.924 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 22 VirtualLinkID: 166 (src: 11 dst: 3 ), Required Capacity: 29.924 Free Capacity (on the graph): 1.167 Free Capacity (on the corresponding array:) 1.167 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [3, 6] free capacity.
  • Update value is -29.924
  • Updated Virtual Link's (3,6,0) free capacity to 4.738.
  • que 1 req 22 (src 3 dst 6 num 0) type Grm capacity 29.924 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 22 VirtualLinkID: 181 (src: 3 dst: 6 ), Required Capacity: 29.924 Free Capacity (on the graph): 4.738 Free Capacity (on the corresponding array:) 4.738 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(11,3,0)[(0,165,8.909,'New'),(1,22,29.924,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,3,0)[38.833,1.167,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,22)[(11,3,0,'Grm',29.924,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,6,0)[(0,180,5.338,'New'),(1,22,29.924,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,6,0)[35.262,4.738,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,22)[(11,3,0,'Grm',29.924,0,0),(3,6,0,'Grm',29.924,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step205_Que1_Req22.html

    Time of processing all requests 254.502, Time of current queue's turn 54.502
    Step 206Processing queue 1request 23from Node1 (1)to Node9 (9) Remain 29.809 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 29.809 Gbps, to route the capacity requirement from Node1 to Node9
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 29.809 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 8.067 31.933 1
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    1 13 12 10 9 5 8 3
    6 11
    2 10
    8 6 10
    9 6 13
    0 5
    3 7
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    9 6 0 30.785
    0 5 0 30.822
    1 10 0 31.188
    1 9 0 31.933
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {1: [13, 12, 10, 9, 5, 8, 3], 6: [11], 2: [10], 8: [6, 10], 9: [6, 13], 0: [5], 3: [7], 13: [7], 12: [5]}
  • Source: 1
  • Destination: 9
  • All paths [1, 9] .
  • Processing path [1, 9]
  • Path2links [[1, 9]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[1, 9]]
  • Subtract the utilised capacity from the Link's [1, 9] free capacity.
  • Update value is -29.809
  • Updated Virtual Link's (1,9,0) free capacity to 2.124.
  • que 1 req 23 (src 1 dst 9 num 0) type Grm capacity 29.809 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 23 VirtualLinkID: 170 (src: 1 dst: 9 ), Required Capacity: 29.809 Free Capacity (on the graph): 2.124 Free Capacity (on the corresponding array:) 2.124 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,9,0)[(0,169,8.067,'New'),(1,23,29.809,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,9,0)[37.876,2.124,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,23)[(1,9,0,'Grm',29.809,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step206_Que1_Req23.html

    Time of processing all requests 268.093, Time of current queue's turn 68.093
    Step 207Processing queue 1request 24from Node0 (0)to Node13 (13) Remain 29.793 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 29.793 Gbps, to route the capacity requirement from Node0 to Node13
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 29.793 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    1 13 12 10 5 8 3
    6 11
    2 10
    8 6 10
    9 6 13
    0 5
    3 7
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    9 6 0 30.785
    0 5 0 30.822
    1 10 0 31.188
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {1: [13, 12, 10, 5, 8, 3], 6: [11], 2: [10], 8: [6, 10], 9: [6, 13], 0: [5], 3: [7], 13: [7], 12: [5]}
  • Source: 0
  • Destination: 13
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 29.793
  • Adding a new virtual link from 0 to 13 .
  • A new virtual link (0, 13, 1) is created for queue 1 , request 24 , from Node0 to Node13 capacity requirement 29.793 Gbps, having free capacity 10.207 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 0 → 13 are = [15.417]
  • Capacities are [15.417]
  • que 1 req 24 (src 0 dst 13 num 1) type New capacity 29.793 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(0,13)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,13,1)[(1,24,29.793,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,13,1)[29.793,10.207,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,24)[(0,13,1,'New',29.793,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step207_Que1_Req24.html

    Time of processing all requests 277.864, Time of current queue's turn 77.864
    Step 208Processing queue 1request 25from Node2 (2)to Node8 (8) Remain 29.53 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 29.53 Gbps, to route the capacity requirement from Node2 to Node8
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 29.53 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    2 10
    8 6 10
    9 6 13
    0 5
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    9 6 0 30.785
    0 5 0 30.822
    1 10 0 31.188
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 2: [10], 8: [6, 10], 9: [6, 13], 0: [5], 13: [7], 12: [5]}
  • Source: 2
  • Destination: 8
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 29.53
  • Adding a new virtual link from 2 to 8 .
  • A new virtual link (2, 8, 1) is created for queue 1 , request 25 , from Node2 to Node8 capacity requirement 29.53 Gbps, having free capacity 10.47 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 2 → 8 are = [0.376]
  • Capacities are [0.376]
  • que 1 req 25 (src 2 dst 8 num 1) type New capacity 29.530 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(2,8)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,8,1)[(1,25,29.530,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,8,1)[29.530,10.470,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,25)[(2,8,1,'New',29.530,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step208_Que1_Req25.html

    Time of processing all requests 287.014, Time of current queue's turn 87.014
    Step 209Processing queue 1request 26from Node7 (7)to Node10 (10) Remain 29.452 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 29.452 Gbps, to route the capacity requirement from Node7 to Node10
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 29.452 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    2 10
    8 6 10
    9 6 13
    0 5
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    9 6 0 30.785
    0 5 0 30.822
    1 10 0 31.188
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 2: [10], 8: [6, 10], 9: [6, 13], 0: [5], 13: [7], 12: [5]}
  • Source: 7
  • Destination: 10
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 29.452
  • Adding a new virtual link from 7 to 10 .
  • A new virtual link (7, 10, 1) is created for queue 1 , request 26 , from Node7 to Node10 capacity requirement 29.452 Gbps, having free capacity 10.548 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 7 → 10 are = [25.506]
  • Capacities are [25.506]
  • que 1 req 26 (src 7 dst 10 num 1) type New capacity 29.452 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(7,10)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,10,1)[(1,26,29.452,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,10,1)[29.452,10.548,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,26)[(7,10,1,'New',29.452,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step209_Que1_Req26.html

    Time of processing all requests 299.958, Time of current queue's turn 99.958
    Step 210Processing queue 1request 27from Node7 (7)to Node2 (2) Remain 29.346 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 29.346 Gbps, to route the capacity requirement from Node7 to Node2
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 29.346 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    2 10
    8 6 10
    9 6 13
    0 5
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    9 6 0 30.785
    0 5 0 30.822
    1 10 0 31.188
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 2: [10], 8: [6, 10], 9: [6, 13], 0: [5], 13: [7], 12: [5]}
  • Source: 7
  • Destination: 2
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 29.346
  • Adding a new virtual link from 7 to 2 .
  • A new virtual link (7, 2, 1) is created for queue 1 , request 27 , from Node7 to Node2 capacity requirement 29.346 Gbps, having free capacity 10.654 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 7 → 2 are = [18.575]
  • Capacities are [18.575]
  • que 1 req 27 (src 7 dst 2 num 1) type New capacity 29.346 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(7,2)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,2,1)[(1,27,29.346,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,2,1)[29.346,10.654,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,27)[(7,2,1,'New',29.346,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step210_Que1_Req27.html

    Time of processing all requests 309.477, Time of current queue's turn 9.477
    Step 211Processing queue 1request 28from Node6 (6)to Node7 (7) Remain 29.278 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 29.278 Gbps, to route the capacity requirement from Node6 to Node7
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 29.278 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    2 10
    8 6 10
    9 6 13
    0 5
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    9 6 0 30.785
    0 5 0 30.822
    1 10 0 31.188
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 2: [10], 8: [6, 10], 9: [6, 13], 0: [5], 13: [7], 12: [5]}
  • Source: 6
  • Destination: 7
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 29.278
  • Adding a new virtual link from 6 to 7 .
  • A new virtual link (6, 7, 1) is created for queue 1 , request 28 , from Node6 to Node7 capacity requirement 29.278 Gbps, having free capacity 10.722 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 6 → 7 are = [8.224]
  • Capacities are [8.224]
  • que 1 req 28 (src 6 dst 7 num 1) type New capacity 29.278 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(6,7)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,7,1)[(1,28,29.278,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,7,1)[29.278,10.722,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,28)[(6,7,1,'New',29.278,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step211_Que1_Req28.html

    Time of processing all requests 319.063, Time of current queue's turn 19.063
    Step 212Processing queue 1request 29from Node9 (9)to Node2 (2) Remain 29.097 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 29.097 Gbps, to route the capacity requirement from Node9 to Node2
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 29.097 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    8 6 10
    9 6 13
    0 5
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    9 6 0 30.785
    0 5 0 30.822
    1 10 0 31.188
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 8: [6, 10], 9: [6, 13], 0: [5], 13: [7], 12: [5]}
  • Source: 9
  • Destination: 2
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 29.097
  • Adding a new virtual link from 9 to 2 .
  • A new virtual link (9, 2, 1) is created for queue 1 , request 29 , from Node9 to Node2 capacity requirement 29.097 Gbps, having free capacity 10.903 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 9 → 2 are = [0.114]
  • Capacities are [0.114]
  • que 1 req 29 (src 9 dst 2 num 1) type New capacity 29.097 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(9,2)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,2,1)[(1,29,29.097,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,2,1)[29.097,10.903,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,29)[(9,2,1,'New',29.097,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step212_Que1_Req29.html

    Time of processing all requests 332.197, Time of current queue's turn 32.197
    Step 213Processing queue 1request 30from Node4 (4)to Node8 (8) Remain 29.038 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 29.038 Gbps, to route the capacity requirement from Node4 to Node8
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 29.038 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    8 6 10
    9 6 13
    0 5
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    9 6 0 30.785
    0 5 0 30.822
    1 10 0 31.188
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 8: [6, 10], 9: [6, 13], 0: [5], 13: [7], 12: [5]}
  • Source: 4
  • Destination: 8
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 29.038
  • Adding a new virtual link from 4 to 8 .
  • A new virtual link (4, 8, 1) is created for queue 1 , request 30 , from Node4 to Node8 capacity requirement 29.038 Gbps, having free capacity 10.962 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 4 → 8 are = [28.513]
  • Capacities are [28.513]
  • que 1 req 30 (src 4 dst 8 num 1) type New capacity 29.038 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(4,8)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,8,1)[(1,30,29.038,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,8,1)[29.038,10.962,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,30)[(4,8,1,'New',29.038,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step213_Que1_Req30.html

    Time of processing all requests 338.978, Time of current queue's turn 38.978
    Step 214Processing queue 1request 31from Node10 (10)to Node7 (7) Remain 28.698 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 28.698 Gbps, to route the capacity requirement from Node10 to Node7
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 28.698 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    5 4
    0 11 12 5
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    8 6 10
    9 6 13
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    5 4 0 28.797
    0 11 0 28.835
    0 12 0 28.944
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    9 6 0 30.785
    0 5 0 30.822
    1 10 0 31.188
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {5: [4], 0: [11, 12, 5], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 8: [6, 10], 9: [6, 13], 13: [7], 12: [5]}
  • Source: 10
  • Destination: 7
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 28.698
  • Adding a new virtual link from 10 to 7 .
  • A new virtual link (10, 7, 1) is created for queue 1 , request 31 , from Node10 to Node7 capacity requirement 28.698 Gbps, having free capacity 11.302 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 10 → 7 are = [21.256]
  • Capacities are [21.256]
  • que 1 req 31 (src 10 dst 7 num 1) type New capacity 28.698 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(10,7)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,7,1)[(1,31,28.698,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,7,1)[28.698,11.302,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,31)[(10,7,1,'New',28.698,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step214_Que1_Req31.html

    Time of processing all requests 349.067, Time of current queue's turn 49.067
    Step 215Processing queue 1request 32from Node13 (13)to Node10 (10) Remain 28.438 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 28.438 Gbps, to route the capacity requirement from Node13 to Node10
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 28.438 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 8
    12 7 5
    5 4
    0 11 12 5
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    8 6 10
    9 6 13
    13 7
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 8 0 28.513
    12 7 0 28.608
    5 4 0 28.797
    0 11 0 28.835
    0 12 0 28.944
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    9 6 0 30.785
    0 5 0 30.822
    1 10 0 31.188
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {4: [8], 12: [7, 5], 5: [4], 0: [11, 12, 5], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 8: [6, 10], 9: [6, 13], 13: [7]}
  • Source: 13
  • Destination: 10
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 28.438
  • Adding a new virtual link from 13 to 10 .
  • A new virtual link (13, 10, 1) is created for queue 1 , request 32 , from Node13 to Node10 capacity requirement 28.438 Gbps, having free capacity 11.562 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 13 → 10 are = [5.073]
  • Capacities are [5.073]
  • que 1 req 32 (src 13 dst 10 num 1) type New capacity 28.438 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(13,10)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,10,1)[(1,32,28.438,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,10,1)[28.438,11.562,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,32)[(13,10,1,'New',28.438,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step215_Que1_Req32.html

    Time of processing all requests 358.694, Time of current queue's turn 58.694
    Step 216Processing queue 1request 33from Node12 (12)to Node7 (7) Remain 28.393 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 28.393 Gbps, to route the capacity requirement from Node12 to Node7
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 28.393 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 11.392 28.608 1
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 8
    12 7 5
    5 4
    0 11 12 5
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    8 6 10
    9 6 13
    13 7
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 8 0 28.513
    12 7 0 28.608
    5 4 0 28.797
    0 11 0 28.835
    0 12 0 28.944
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    9 6 0 30.785
    0 5 0 30.822
    1 10 0 31.188
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {4: [8], 12: [7, 5], 5: [4], 0: [11, 12, 5], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 8: [6, 10], 9: [6, 13], 13: [7]}
  • Source: 12
  • Destination: 7
  • All paths [12, 7] .
  • Processing path [12, 7]
  • Path2links [[12, 7]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[12, 7]]
  • Subtract the utilised capacity from the Link's [12, 7] free capacity.
  • Update value is -28.393
  • Updated Virtual Link's (12,7,0) free capacity to 0.215.
  • que 1 req 33 (src 12 dst 7 num 0) type Grm capacity 28.393 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 33 VirtualLinkID: 148 (src: 12 dst: 7 ), Required Capacity: 28.393 Free Capacity (on the graph): 0.215 Free Capacity (on the corresponding array:) 0.215 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,7,0)[(0,147,11.392,'New'),(1,33,28.393,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,7,0)[39.785,0.215,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,33)[(12,7,0,'Grm',28.393,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step216_Que1_Req33.html

    Time of processing all requests 367.679, Time of current queue's turn 67.679
    Step 217Processing queue 1request 34from Node9 (9)to Node6 (6) Remain 28.296 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 28.296 Gbps, to route the capacity requirement from Node9 to Node6
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 28.296 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 9.215 30.785 1
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 8
    5 4
    0 11 12 5
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    8 6 10
    9 6 13
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 8 0 28.513
    5 4 0 28.797
    0 11 0 28.835
    0 12 0 28.944
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    9 6 0 30.785
    0 5 0 30.822
    1 10 0 31.188
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {4: [8], 5: [4], 0: [11, 12, 5], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 8: [6, 10], 9: [6, 13], 13: [7], 12: [5]}
  • Source: 9
  • Destination: 6
  • All paths [9, 6] .
  • Processing path [9, 6]
  • Path2links [[9, 6]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[9, 6]]
  • Subtract the utilised capacity from the Link's [9, 6] free capacity.
  • Update value is -28.296
  • Updated Virtual Link's (9,6,0) free capacity to 2.489.
  • que 1 req 34 (src 9 dst 6 num 0) type Grm capacity 28.296 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 34 VirtualLinkID: 164 (src: 9 dst: 6 ), Required Capacity: 28.296 Free Capacity (on the graph): 2.489 Free Capacity (on the corresponding array:) 2.489 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(9,6,0)[(0,163,9.215,'New'),(1,34,28.296,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,6,0)[37.511,2.489,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,34)[(9,6,0,'Grm',28.296,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step217_Que1_Req34.html

    Time of processing all requests 381.283, Time of current queue's turn 81.283
    Step 218Processing queue 1request 35from Node8 (8)to Node10 (10) Remain 28.039 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 28.039 Gbps, to route the capacity requirement from Node8 to Node10
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 28.039 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 6.56 33.44 1
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    6 0 11
    4 8
    5 4
    0 11 12 5
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    8 6 10
    9 13
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    6 0 0 28.09
    4 8 0 28.513
    5 4 0 28.797
    0 11 0 28.835
    0 12 0 28.944
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    0 5 0 30.822
    1 10 0 31.188
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    8 10 0 33.44
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {6: [0, 11], 4: [8], 5: [4], 0: [11, 12, 5], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 8: [6, 10], 9: [13], 13: [7], 12: [5]}
  • Source: 8
  • Destination: 10
  • All paths [8, 10] .
  • Processing path [8, 10]
  • Path2links [[8, 10]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[8, 10]]
  • Subtract the utilised capacity from the Link's [8, 10] free capacity.
  • Update value is -28.039
  • Updated Virtual Link's (8,10,0) free capacity to 5.401.
  • que 1 req 35 (src 8 dst 10 num 0) type Grm capacity 28.039 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 35 VirtualLinkID: 175 (src: 8 dst: 10 ), Required Capacity: 28.039 Free Capacity (on the graph): 5.401 Free Capacity (on the corresponding array:) 5.401 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,10,0)[(0,174,6.560,'New'),(1,35,28.039,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,10,0)[34.599,5.401,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,35)[(8,10,0,'Grm',28.039,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step218_Que1_Req35.html

    Time of processing all requests 391.488, Time of current queue's turn 91.488
    Step 219Processing queue 1request 36from Node12 (12)to Node10 (10) Remain 27.872 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 27.872 Gbps, to route the capacity requirement from Node12 to Node10
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 27.872 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    6 0 11
    4 8
    5 4
    0 11 12 5
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    8 6
    9 13
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    6 0 0 28.09
    4 8 0 28.513
    5 4 0 28.797
    0 11 0 28.835
    0 12 0 28.944
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    0 5 0 30.822
    1 10 0 31.188
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {6: [0, 11], 4: [8], 5: [4], 0: [11, 12, 5], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 8: [6], 9: [13], 13: [7], 12: [5]}
  • Source: 12
  • Destination: 10
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 27.872
  • Adding a new virtual link from 12 to 10 .
  • A new virtual link (12, 10, 1) is created for queue 1 , request 36 , from Node12 to Node10 capacity requirement 27.872 Gbps, having free capacity 12.128 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 12 → 10 are = [16.51]
  • Capacities are [16.51]
  • que 1 req 36 (src 12 dst 10 num 1) type New capacity 27.872 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(12,10)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(12,10,1)[(1,36,27.872,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,10,1)[27.872,12.128,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,36)[(12,10,1,'New',27.872,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step219_Que1_Req36.html

    Time of processing all requests 405.475, Time of current queue's turn 5.475
    Step 220Processing queue 1request 37from Node2 (2)to Node7 (7) Remain 27.771 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 27.771 Gbps, to route the capacity requirement from Node2 to Node7
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 27.771 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    6 0 11
    4 8
    5 4
    0 11 12 5
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    8 6
    9 13
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    6 0 0 28.09
    4 8 0 28.513
    5 4 0 28.797
    0 11 0 28.835
    0 12 0 28.944
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    0 5 0 30.822
    1 10 0 31.188
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {6: [0, 11], 4: [8], 5: [4], 0: [11, 12, 5], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 8: [6], 9: [13], 13: [7], 12: [5]}
  • Source: 2
  • Destination: 7
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 27.771
  • Adding a new virtual link from 2 to 7 .
  • A new virtual link (2, 7, 1) is created for queue 1 , request 37 , from Node2 to Node7 capacity requirement 27.771 Gbps, having free capacity 12.229 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 2 → 7 are = [9.025]
  • Capacities are [9.025]
  • que 1 req 37 (src 2 dst 7 num 1) type New capacity 27.771 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(2,7)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,7,1)[(1,37,27.771,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,7,1)[27.771,12.229,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,37)[(2,7,1,'New',27.771,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step220_Que1_Req37.html

    Time of processing all requests 414.906, Time of current queue's turn 14.906
    Step 221Processing queue 1request 38from Node2 (2)to Node9 (9) Remain 27.755 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 27.755 Gbps, to route the capacity requirement from Node2 to Node9
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 27.755 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    6 0 11
    4 8
    5 4
    0 11 12 5
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    8 6
    9 13
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    6 0 0 28.09
    4 8 0 28.513
    5 4 0 28.797
    0 11 0 28.835
    0 12 0 28.944
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    0 5 0 30.822
    1 10 0 31.188
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {6: [0, 11], 4: [8], 5: [4], 0: [11, 12, 5], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 8: [6], 9: [13], 13: [7], 12: [5]}
  • Source: 2
  • Destination: 9
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 27.755
  • Adding a new virtual link from 2 to 9 .
  • A new virtual link (2, 9, 1) is created for queue 1 , request 38 , from Node2 to Node9 capacity requirement 27.755 Gbps, having free capacity 12.245 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 2 → 9 are = [19.445]
  • Capacities are [19.445]
  • que 1 req 38 (src 2 dst 9 num 1) type New capacity 27.755 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(2,9)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,9,1)[(1,38,27.755,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,9,1)[27.755,12.245,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,38)[(2,9,1,'New',27.755,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step221_Que1_Req38.html

    Time of processing all requests 428.303, Time of current queue's turn 28.303
    Step 222Processing queue 1request 39from Node9 (9)to Node4 (4) Remain 27.59 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 27.59 Gbps, to route the capacity requirement from Node9 to Node4
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 27.59 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 12.377 27.623 1
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 11.203 28.797 1
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 9.178 30.822 1
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 7.4 32.6 1
    8 0 0 39.192 0.808 2
    13 7 0 6.702 33.298 1
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    7 0 13
    4 1 8
    6 0 11
    5 4
    0 11 12 5
    2 5 10
    3 2 7
    1 13 12 10 5 8 3
    8 6
    9 13
    13 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    7 0 0 27.623
    4 1 0 27.7
    6 0 0 28.09
    4 8 0 28.513
    5 4 0 28.797
    0 11 0 28.835
    0 12 0 28.944
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    0 5 0 30.822
    1 10 0 31.188
    3 7 0 32.099
    9 13 0 32.6
    13 7 0 33.298
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {7: [0, 13], 4: [1, 8], 6: [0, 11], 5: [4], 0: [11, 12, 5], 2: [5, 10], 3: [2, 7], 1: [13, 12, 10, 5, 8, 3], 8: [6], 9: [13], 13: [7], 12: [5]}
  • Source: 9
  • Destination: 4
  • All paths [9, 13, 7, 0, 5, 4] .
  • Processing path [9, 13, 7, 0, 5, 4]
  • Path2links [[9, 13], [13, 7], [7, 0], [0, 5], [5, 4]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[9, 13], [13, 7], [7, 0], [0, 5], [5, 4]]
  • Subtract the utilised capacity from the Link's [9, 13] free capacity.
  • Update value is -27.59
  • Updated Virtual Link's (9,13,0) free capacity to 5.010.
  • que 1 req 39 (src 9 dst 13 num 0) type Grm capacity 27.590 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 39 VirtualLinkID: 172 (src: 9 dst: 13 ), Required Capacity: 27.59 Free Capacity (on the graph): 5.01 Free Capacity (on the corresponding array:) 5.01 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [13, 7] free capacity.
  • Update value is -27.59
  • Updated Virtual Link's (13,7,0) free capacity to 5.708.
  • que 1 req 39 (src 13 dst 7 num 0) type Grm capacity 27.590 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 39 VirtualLinkID: 174 (src: 13 dst: 7 ), Required Capacity: 27.59 Free Capacity (on the graph): 5.708 Free Capacity (on the corresponding array:) 5.708 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [7, 0] free capacity.
  • Update value is -27.59
  • Updated Virtual Link's (7,0,0) free capacity to 0.033.
  • que 1 req 39 (src 7 dst 0 num 0) type Grm capacity 27.590 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 39 VirtualLinkID: 144 (src: 7 dst: 0 ), Required Capacity: 27.59 Free Capacity (on the graph): 0.033 Free Capacity (on the corresponding array:) 0.033 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [0, 5] free capacity.
  • Update value is -27.59
  • Updated Virtual Link's (0,5,0) free capacity to 3.232.
  • que 1 req 39 (src 0 dst 5 num 0) type Grm capacity 27.590 step of routing reqquested traffic 0 step's virtual link sequence number 3
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 39 VirtualLinkID: 165 (src: 0 dst: 5 ), Required Capacity: 27.59 Free Capacity (on the graph): 3.232 Free Capacity (on the corresponding array:) 3.232 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [5, 4] free capacity.
  • Update value is -27.59
  • Updated Virtual Link's (5,4,0) free capacity to 1.207.
  • que 1 req 39 (src 5 dst 4 num 0) type Grm capacity 27.590 step of routing reqquested traffic 0 step's virtual link sequence number 4
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 39 VirtualLinkID: 149 (src: 5 dst: 4 ), Required Capacity: 27.59 Free Capacity (on the graph): 1.207 Free Capacity (on the corresponding array:) 1.207 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(9,13,0)[(0,171,7.400,'New'),(1,39,27.590,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,13,0)[34.990,5.010,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,39)[(9,13,0,'Grm',27.590,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(13,7,0)[(0,173,6.702,'New'),(1,39,27.590,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,7,0)[34.292,5.708,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,39)[(9,13,0,'Grm',27.590,0,0),(13,7,0,'Grm',27.590,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(7,0,0)[(0,143,12.377,'New'),(1,39,27.590,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,0,0)[39.967,0.033,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,39)[(9,13,0,'Grm',27.590,0,0),(13,7,0,'Grm',27.590,0,1),(7,0,0,'Grm',27.590,0,2)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(0,5,0)[(0,164,9.178,'New'),(1,39,27.590,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,5,0)[36.768,3.232,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,39)[(9,13,0,'Grm',27.590,0,0),(13,7,0,'Grm',27.590,0,1),(7,0,0,'Grm',27.590,0,2),(0,5,0,'Grm',27.590,0,3)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(5,4,0)[(0,148,11.203,'New'),(1,39,27.590,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,4,0)[38.793,1.207,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,39)[(9,13,0,'Grm',27.590,0,0),(13,7,0,'Grm',27.590,0,1),(7,0,0,'Grm',27.590,0,2),(0,5,0,'Grm',27.590,0,3),(5,4,0,'Grm',27.590,0,4)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step222_Que1_Req39.html

    Time of processing all requests 437.821, Time of current queue's turn 37.821
    Step 223Processing queue 1request 40from Node5 (5)to Node9 (9) Remain 27.551 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 27.551 Gbps, to route the capacity requirement from Node5 to Node9
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 27.551 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 1 8
    6 0 11
    0 11 12
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    8 6
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 1 0 27.7
    6 0 0 28.09
    4 8 0 28.513
    0 11 0 28.835
    0 12 0 28.944
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {4: [1, 8], 6: [0, 11], 0: [11, 12], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 8: [6], 12: [5]}
  • Source: 5
  • Destination: 9
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 27.551
  • Adding a new virtual link from 5 to 9 .
  • A new virtual link (5, 9, 1) is created for queue 1 , request 40 , from Node5 to Node9 capacity requirement 27.551 Gbps, having free capacity 12.449 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 5 → 9 are = [25.563]
  • Capacities are [25.563]
  • que 1 req 40 (src 5 dst 9 num 1) type New capacity 27.551 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(5,9)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,9,1)[(1,40,27.551,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,9,1)[27.551,12.449,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,40)[(5,9,1,'New',27.551,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step223_Que1_Req40.html

    Time of processing all requests 465.822, Time of current queue's turn 65.822
    Step 224Processing queue 1request 41from Node8 (8)to Node12 (12) Remain 27.52 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 27.52 Gbps, to route the capacity requirement from Node8 to Node12
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 27.52 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 11.91 28.09 1
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 11.056 28.944 1
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 9.307 30.693 1
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 1 8
    6 0 11
    0 11 12
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    8 6
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 1 0 27.7
    6 0 0 28.09
    4 8 0 28.513
    0 11 0 28.835
    0 12 0 28.944
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    8 6 0 30.693
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {4: [1, 8], 6: [0, 11], 0: [11, 12], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 8: [6], 12: [5]}
  • Source: 8
  • Destination: 12
  • All paths [8, 6, 0, 12] .
  • Processing path [8, 6, 0, 12]
  • Path2links [[8, 6], [6, 0], [0, 12]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[8, 6], [6, 0], [0, 12]]
  • Subtract the utilised capacity from the Link's [8, 6] free capacity.
  • Update value is -27.52
  • Updated Virtual Link's (8,6,0) free capacity to 3.173.
  • que 1 req 41 (src 8 dst 6 num 0) type Grm capacity 27.520 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 41 VirtualLinkID: 162 (src: 8 dst: 6 ), Required Capacity: 27.52 Free Capacity (on the graph): 3.173 Free Capacity (on the corresponding array:) 3.173 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [6, 0] free capacity.
  • Update value is -27.52
  • Updated Virtual Link's (6,0,0) free capacity to 0.570.
  • que 1 req 41 (src 6 dst 0 num 0) type Grm capacity 27.520 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 41 VirtualLinkID: 146 (src: 6 dst: 0 ), Required Capacity: 27.52 Free Capacity (on the graph): 0.57 Free Capacity (on the corresponding array:) 0.57 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [0, 12] free capacity.
  • Update value is -27.52
  • Updated Virtual Link's (0,12,0) free capacity to 1.424.
  • que 1 req 41 (src 0 dst 12 num 0) type Grm capacity 27.520 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 41 VirtualLinkID: 151 (src: 0 dst: 12 ), Required Capacity: 27.52 Free Capacity (on the graph): 1.424 Free Capacity (on the corresponding array:) 1.424 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,6,0)[(0,161,9.307,'New'),(1,41,27.520,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,6,0)[36.827,3.173,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,41)[(8,6,0,'Grm',27.520,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(6,0,0)[(0,145,11.910,'New'),(1,41,27.520,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,0,0)[39.430,0.570,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,41)[(8,6,0,'Grm',27.520,0,0),(6,0,0,'Grm',27.520,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(0,12,0)[(0,150,11.056,'New'),(1,41,27.520,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,12,0)[38.576,1.424,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,41)[(8,6,0,'Grm',27.520,0,0),(6,0,0,'Grm',27.520,0,1),(0,12,0,'Grm',27.520,0,2)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step224_Que1_Req41.html

    Time of processing all requests 476.301, Time of current queue's turn 76.301
    Step 225Processing queue 1request 42from Node12 (12)to Node8 (8) Remain 27.495 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 27.495 Gbps, to route the capacity requirement from Node12 to Node8
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 27.495 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 1 8
    0 11
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 12: [5]}
  • Source: 12
  • Destination: 8
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 27.495
  • Adding a new virtual link from 12 to 8 .
  • A new virtual link (12, 8, 1) is created for queue 1 , request 42 , from Node12 to Node8 capacity requirement 27.495 Gbps, having free capacity 12.505 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 12 → 8 are = [7.876]
  • Capacities are [7.876]
  • que 1 req 42 (src 12 dst 8 num 1) type New capacity 27.495 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(12,8)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(12,8,1)[(1,42,27.495,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,8,1)[27.495,12.505,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,42)[(12,8,1,'New',27.495,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step225_Que1_Req42.html

    Time of processing all requests 492.346, Time of current queue's turn 92.346
    Step 226Processing queue 1request 43from Node10 (10)to Node1 (1) Remain 27.4 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 27.4 Gbps, to route the capacity requirement from Node10 to Node1
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 27.4 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 1 8
    0 11
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 12: [5]}
  • Source: 10
  • Destination: 1
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 27.4
  • Adding a new virtual link from 10 to 1 .
  • A new virtual link (10, 1, 1) is created for queue 1 , request 43 , from Node10 to Node1 capacity requirement 27.4 Gbps, having free capacity 12.6 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 10 → 1 are = [25.342]
  • Capacities are [25.342]
  • que 1 req 43 (src 10 dst 1 num 1) type New capacity 27.400 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(10,1)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,1,1)[(1,43,27.400,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,1,1)[27.400,12.600,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,43)[(10,1,1,'New',27.400,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step226_Que1_Req43.html

    Time of processing all requests 501.397, Time of current queue's turn 1.397
    Step 227Processing queue 1request 44from Node4 (4)to Node9 (9) Remain 27.381 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 27.381 Gbps, to route the capacity requirement from Node4 to Node9
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 27.381 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 1 8
    0 11
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 12: [5]}
  • Source: 4
  • Destination: 9
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 27.381
  • Adding a new virtual link from 4 to 9 .
  • A new virtual link (4, 9, 1) is created for queue 1 , request 44 , from Node4 to Node9 capacity requirement 27.381 Gbps, having free capacity 12.619 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 4 → 9 are = [13.252]
  • Capacities are [13.252]
  • que 1 req 44 (src 4 dst 9 num 1) type New capacity 27.381 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(4,9)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,9,1)[(1,44,27.381,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,9,1)[27.381,12.619,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,44)[(4,9,1,'New',27.381,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step227_Que1_Req44.html

    Time of processing all requests 511.635, Time of current queue's turn 11.635
    Step 228Processing queue 1request 45from Node9 (9)to Node10 (10) Remain 27.087 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 27.087 Gbps, to route the capacity requirement from Node9 to Node10
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 27.087 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 1 8
    0 11
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 12: [5]}
  • Source: 9
  • Destination: 10
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 27.087
  • Adding a new virtual link from 9 to 10 .
  • A new virtual link (9, 10, 1) is created for queue 1 , request 45 , from Node9 to Node10 capacity requirement 27.087 Gbps, having free capacity 12.913 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 9 → 10 are = [19.338]
  • Capacities are [19.338]
  • que 1 req 45 (src 9 dst 10 num 1) type New capacity 27.087 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(9,10)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,10,1)[(1,45,27.087,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,10,1)[27.087,12.913,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,45)[(9,10,1,'New',27.087,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step228_Que1_Req45.html

    Time of processing all requests 524.966, Time of current queue's turn 24.966
    Step 229Processing queue 1request 46from Node10 (10)to Node9 (9) Remain 27.053 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 27.053 Gbps, to route the capacity requirement from Node10 to Node9
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 27.053 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 1 8
    0 11
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 12: [5]}
  • Source: 10
  • Destination: 9
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 27.053
  • Adding a new virtual link from 10 to 9 .
  • A new virtual link (10, 9, 1) is created for queue 1 , request 46 , from Node10 to Node9 capacity requirement 27.053 Gbps, having free capacity 12.947 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 10 → 9 are = [9.359]
  • Capacities are [9.359]
  • que 1 req 46 (src 10 dst 9 num 1) type New capacity 27.053 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(10,9)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,9,1)[(1,46,27.053,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,9,1)[27.053,12.947,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,46)[(10,9,1,'New',27.053,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step229_Que1_Req46.html

    Time of processing all requests 534.169, Time of current queue's turn 34.169
    Step 230Processing queue 1request 47from Node0 (0)to Node2 (2) Remain 26.443 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 26.443 Gbps, to route the capacity requirement from Node0 to Node2
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 26.443 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 13.19 26.81 1
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 5
    11 9
    0 2 11
    4 1 8
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 5 0 26.552
    11 9 0 26.555
    0 2 0 26.81
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {10: [5], 11: [9], 0: [2, 11], 4: [1, 8], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 12: [5]}
  • Source: 0
  • Destination: 2
  • All paths [0, 2] .
  • Processing path [0, 2]
  • Path2links [[0, 2]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[0, 2]]
  • Subtract the utilised capacity from the Link's [0, 2] free capacity.
  • Update value is -26.443
  • Updated Virtual Link's (0,2,0) free capacity to 0.367.
  • que 1 req 47 (src 0 dst 2 num 0) type Grm capacity 26.443 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 47 VirtualLinkID: 143 (src: 0 dst: 2 ), Required Capacity: 26.443 Free Capacity (on the graph): 0.367 Free Capacity (on the corresponding array:) 0.367 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(0,2,0)[(0,142,13.190,'New'),(1,47,26.443,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,2,0)[39.633,0.367,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,47)[(0,2,0,'Grm',26.443,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step230_Que1_Req47.html

    Time of processing all requests 547.493, Time of current queue's turn 47.493
    Step 231Processing queue 1request 48from Node9 (9)to Node8 (8) Remain 26.269 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 26.269 Gbps, to route the capacity requirement from Node9 to Node8
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 26.269 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 5
    11 9
    4 1 8
    0 11
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 5 0 26.552
    11 9 0 26.555
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {10: [5], 11: [9], 4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 12: [5]}
  • Source: 9
  • Destination: 8
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 26.269
  • Adding a new virtual link from 9 to 8 .
  • A new virtual link (9, 8, 1) is created for queue 1 , request 48 , from Node9 to Node8 capacity requirement 26.269 Gbps, having free capacity 13.731 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 9 → 8 are = [26.062]
  • Capacities are [26.062]
  • que 1 req 48 (src 9 dst 8 num 1) type New capacity 26.269 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(9,8)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,8,1)[(1,48,26.269,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,8,1)[26.269,13.731,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,48)[(9,8,1,'New',26.269,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step231_Que1_Req48.html

    Time of processing all requests 557.161, Time of current queue's turn 57.161
    Step 232Processing queue 1request 49from Node5 (5)to Node4 (4) Remain 26.255 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 26.255 Gbps, to route the capacity requirement from Node5 to Node4
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 26.255 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 5
    11 9
    4 1 8
    0 11
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 5 0 26.552
    11 9 0 26.555
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {10: [5], 11: [9], 4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 12: [5]}
  • Source: 5
  • Destination: 4
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 26.255
  • Adding a new virtual link from 5 to 4 .
  • A new virtual link (5, 4, 1) is created for queue 1 , request 49 , from Node5 to Node4 capacity requirement 26.255 Gbps, having free capacity 13.745 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 5 → 4 are = [1.207]
  • Capacities are [1.207]
  • que 1 req 49 (src 5 dst 4 num 1) type New capacity 26.255 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(5,4)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,4,1)[(1,49,26.255,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,4,1)[26.255,13.745,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,49)[(5,4,1,'New',26.255,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step232_Que1_Req49.html

    Time of processing all requests 571.321, Time of current queue's turn 71.321
    Step 233Processing queue 1request 50from Node9 (9)to Node12 (12) Remain 26.131 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 26.131 Gbps, to route the capacity requirement from Node9 to Node12
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 26.131 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 5
    11 9
    4 1 8
    0 11
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 5 0 26.552
    11 9 0 26.555
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {10: [5], 11: [9], 4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 12: [5]}
  • Source: 9
  • Destination: 12
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 26.131
  • Adding a new virtual link from 9 to 12 .
  • A new virtual link (9, 12, 1) is created for queue 1 , request 50 , from Node9 to Node12 capacity requirement 26.131 Gbps, having free capacity 13.869 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 9 → 12 are = [24.08]
  • Capacities are [24.08]
  • que 1 req 50 (src 9 dst 12 num 1) type New capacity 26.131 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(9,12)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,12,1)[(1,50,26.131,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,12,1)[26.131,13.869,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,50)[(9,12,1,'New',26.131,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step233_Que1_Req50.html

    Time of processing all requests 580.800, Time of current queue's turn 80.800
    Step 234Processing queue 1request 51from Node5 (5)to Node12 (12) Remain 26.022 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 26.022 Gbps, to route the capacity requirement from Node5 to Node12
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 26.022 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 8
    10 5
    11 9
    4 1 8
    0 11
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 8 0 26.062
    10 5 0 26.552
    11 9 0 26.555
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {9: [8], 10: [5], 11: [9], 4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 12: [5]}
  • Source: 5
  • Destination: 12
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 26.022
  • Adding a new virtual link from 5 to 12 .
  • A new virtual link (5, 12, 1) is created for queue 1 , request 51 , from Node5 to Node12 capacity requirement 26.022 Gbps, having free capacity 13.978 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 5 → 12 are = [16.887]
  • Capacities are [16.887]
  • que 1 req 51 (src 5 dst 12 num 1) type New capacity 26.022 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(5,12)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,12,1)[(1,51,26.022,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,12,1)[26.022,13.978,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,51)[(5,12,1,'New',26.022,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step234_Que1_Req51.html

    Time of processing all requests 594.610, Time of current queue's turn 94.610
    Step 235Processing queue 1request 52from Node9 (9)to Node7 (7) Remain 26.002 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 26.002 Gbps, to route the capacity requirement from Node9 to Node7
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 26.002 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    0 3 11
    9 8
    10 5
    11 9
    4 1 8
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    0 3 0 26.008
    9 8 0 26.062
    10 5 0 26.552
    11 9 0 26.555
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {0: [3, 11], 9: [8], 10: [5], 11: [9], 4: [1, 8], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 12: [5]}
  • Source: 9
  • Destination: 7
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 26.002
  • Adding a new virtual link from 9 to 7 .
  • A new virtual link (9, 7, 1) is created for queue 1 , request 52 , from Node9 to Node7 capacity requirement 26.002 Gbps, having free capacity 13.998 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 9 → 7 are = [12.078]
  • Capacities are [12.078]
  • que 1 req 52 (src 9 dst 7 num 1) type New capacity 26.002 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(9,7)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,7,1)[(1,52,26.002,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,7,1)[26.002,13.998,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,52)[(9,7,1,'New',26.002,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step235_Que1_Req52.html

    Time of processing all requests 608.384, Time of current queue's turn 8.384
    Step 236Processing queue 1request 53from Node6 (6)to Node9 (9) Remain 25.857 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 25.857 Gbps, to route the capacity requirement from Node6 to Node9
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 25.857 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 13.445 26.555 1
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 9.775 30.225 1
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    0 3 11
    9 8
    10 5
    11 9
    4 1 8
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    6 11
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    0 3 0 26.008
    9 8 0 26.062
    10 5 0 26.552
    11 9 0 26.555
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    6 11 0 30.225
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {0: [3, 11], 9: [8], 10: [5], 11: [9], 4: [1, 8], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 6: [11], 12: [5]}
  • Source: 6
  • Destination: 9
  • All paths [6, 11, 9] .
  • Processing path [6, 11, 9]
  • Path2links [[6, 11], [11, 9]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[6, 11], [11, 9]]
  • Subtract the utilised capacity from the Link's [6, 11] free capacity.
  • Update value is -25.857
  • Updated Virtual Link's (6,11,0) free capacity to 4.368.
  • que 1 req 53 (src 6 dst 11 num 0) type Grm capacity 25.857 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 53 VirtualLinkID: 158 (src: 6 dst: 11 ), Required Capacity: 25.857 Free Capacity (on the graph): 4.368 Free Capacity (on the corresponding array:) 4.368 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [11, 9] free capacity.
  • Update value is -25.857
  • Updated Virtual Link's (11,9,0) free capacity to 0.698.
  • que 1 req 53 (src 11 dst 9 num 0) type Grm capacity 25.857 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 53 VirtualLinkID: 142 (src: 11 dst: 9 ), Required Capacity: 25.857 Free Capacity (on the graph): 0.698 Free Capacity (on the corresponding array:) 0.698 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(6,11,0)[(0,157,9.775,'New'),(1,53,25.857,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,11,0)[35.632,4.368,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,53)[(6,11,0,'Grm',25.857,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(11,9,0)[(0,141,13.445,'New'),(1,53,25.857,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,9,0)[39.302,0.698,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,53)[(6,11,0,'Grm',25.857,0,0),(11,9,0,'Grm',25.857,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step236_Que1_Req53.html

    Time of processing all requests 623.209, Time of current queue's turn 23.209
    Step 237Processing queue 1request 54from Node5 (5)to Node2 (2) Remain 25.642 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 25.642 Gbps, to route the capacity requirement from Node5 to Node2
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 25.642 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    0 3 11
    9 8
    10 5
    4 1 8
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    0 3 0 26.008
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {0: [3, 11], 9: [8], 10: [5], 4: [1, 8], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 12: [5]}
  • Source: 5
  • Destination: 2
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 25.642
  • Adding a new virtual link from 5 to 2 .
  • A new virtual link (5, 2, 1) is created for queue 1 , request 54 , from Node5 to Node2 capacity requirement 25.642 Gbps, having free capacity 14.358 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 5 → 2 are = [8.806]
  • Capacities are [8.806]
  • que 1 req 54 (src 5 dst 2 num 1) type New capacity 25.642 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(5,2)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,2,1)[(1,54,25.642,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,2,1)[25.642,14.358,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,54)[(5,2,1,'New',25.642,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step237_Que1_Req54.html

    Time of processing all requests 636.802, Time of current queue's turn 36.802
    Step 238Processing queue 1request 55from Node6 (6)to Node1 (1) Remain 25.614 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 25.614 Gbps, to route the capacity requirement from Node6 to Node1
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 25.614 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    0 3 11
    9 8
    10 5
    4 1 8
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    0 3 0 26.008
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {0: [3, 11], 9: [8], 10: [5], 4: [1, 8], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 12: [5]}
  • Source: 6
  • Destination: 1
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 25.614
  • Adding a new virtual link from 6 to 1 .
  • A new virtual link (6, 1, 1) is created for queue 1 , request 55 , from Node6 to Node1 capacity requirement 25.614 Gbps, having free capacity 14.386 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 6 → 1 are = [20.406]
  • Capacities are [20.406]
  • que 1 req 55 (src 6 dst 1 num 1) type New capacity 25.614 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(6,1)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,1,1)[(1,55,25.614,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,1,1)[25.614,14.386,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,55)[(6,1,1,'New',25.614,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step238_Que1_Req55.html

    Time of processing all requests 646.929, Time of current queue's turn 46.929
    Step 239Processing queue 1request 56from Node0 (0)to Node6 (6) Remain 25.539 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 25.539 Gbps, to route the capacity requirement from Node0 to Node6
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 25.539 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    5 9
    0 3 11
    9 8
    10 5
    4 1 8
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    5 9 0 25.563
    0 3 0 26.008
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {5: [9], 0: [3, 11], 9: [8], 10: [5], 4: [1, 8], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 12: [5]}
  • Source: 0
  • Destination: 6
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 25.539
  • Adding a new virtual link from 0 to 6 .
  • A new virtual link (0, 6, 1) is created for queue 1 , request 56 , from Node0 to Node6 capacity requirement 25.539 Gbps, having free capacity 14.461 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 0 → 6 are = [18.526]
  • Capacities are [18.526]
  • que 1 req 56 (src 0 dst 6 num 1) type New capacity 25.539 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(0,6)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,6,1)[(1,56,25.539,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,6,1)[25.539,14.461,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,56)[(0,6,1,'New',25.539,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step239_Que1_Req56.html

    Time of processing all requests 659.213, Time of current queue's turn 59.213
    Step 240Processing queue 1request 57from Node11 (11)to Node9 (9) Remain 25.534 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 25.534 Gbps, to route the capacity requirement from Node11 to Node9
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 25.534 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    5 9
    0 3 11
    9 8
    10 5
    4 1 8
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    5 9 0 25.563
    0 3 0 26.008
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {5: [9], 0: [3, 11], 9: [8], 10: [5], 4: [1, 8], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 12: [5]}
  • Source: 11
  • Destination: 9
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 25.534
  • Adding a new virtual link from 11 to 9 .
  • A new virtual link (11, 9, 1) is created for queue 1 , request 57 , from Node11 to Node9 capacity requirement 25.534 Gbps, having free capacity 14.466 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 11 → 9 are = [0.698]
  • Capacities are [0.698]
  • que 1 req 57 (src 11 dst 9 num 1) type New capacity 25.534 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(11,9)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,9,1)[(1,57,25.534,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,9,1)[25.534,14.466,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,57)[(11,9,1,'New',25.534,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step240_Que1_Req57.html

    Time of processing all requests 668.865, Time of current queue's turn 68.865
    Step 241Processing queue 1request 58from Node2 (2)to Node6 (6) Remain 25.529 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 25.529 Gbps, to route the capacity requirement from Node2 to Node6
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 25.529 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 1 8
    5 9
    0 3 11
    10 5
    4 1 8
    2 5 10
    3 2 7
    7 13
    1 13 12 10 5 8 3
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 1 0 25.533
    5 9 0 25.563
    0 3 0 26.008
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {9: [1, 8], 5: [9], 0: [3, 11], 10: [5], 4: [1, 8], 2: [5, 10], 3: [2, 7], 7: [13], 1: [13, 12, 10, 5, 8, 3], 12: [5]}
  • Source: 2
  • Destination: 6
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 25.529
  • Adding a new virtual link from 2 to 6 .
  • A new virtual link (2, 6, 1) is created for queue 1 , request 58 , from Node2 to Node6 capacity requirement 25.529 Gbps, having free capacity 14.471 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 2 → 6 are = [13.969]
  • Capacities are [13.969]
  • que 1 req 58 (src 2 dst 6 num 1) type New capacity 25.529 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(2,6)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,6,1)[(1,58,25.529,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,6,1)[25.529,14.471,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,58)[(2,6,1,'New',25.529,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step241_Que1_Req58.html

    Time of processing all requests 680.832, Time of current queue's turn 80.832
    Step 242Processing queue 1request 59from Node13 (13)to Node1 (1) Remain 25.479 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 25.479 Gbps, to route the capacity requirement from Node13 to Node1
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 25.479 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    7 10 13
    9 1 8
    5 9
    0 3 11
    10 5
    4 1 8
    2 5 10
    3 2 7
    1 13 12 10 5 8 3
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    7 10 0 25.506
    9 1 0 25.533
    5 9 0 25.563
    0 3 0 26.008
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {7: [10, 13], 9: [1, 8], 5: [9], 0: [3, 11], 10: [5], 4: [1, 8], 2: [5, 10], 3: [2, 7], 1: [13, 12, 10, 5, 8, 3], 12: [5]}
  • Source: 13
  • Destination: 1
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 25.479
  • Adding a new virtual link from 13 to 1 .
  • A new virtual link (13, 1, 1) is created for queue 1 , request 59 , from Node13 to Node1 capacity requirement 25.479 Gbps, having free capacity 14.521 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 13 → 1 are = [5.866]
  • Capacities are [5.866]
  • que 1 req 59 (src 13 dst 1 num 1) type New capacity 25.479 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(13,1)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,1,1)[(1,59,25.479,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,1,1)[25.479,14.521,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,59)[(13,1,1,'New',25.479,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step242_Que1_Req59.html

    Time of processing all requests 691.781, Time of current queue's turn 91.781
    Step 243Processing queue 1request 60from Node13 (13)to Node11 (11) Remain 24.927 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 24.927 Gbps, to route the capacity requirement from Node13 to Node11
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 24.927 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 1 5
    7 10 13
    9 1 8
    5 9
    0 3 11
    4 1 8
    2 5 10
    3 2 7
    1 13 12 10 5 8 3
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 1 0 25.342
    7 10 0 25.506
    9 1 0 25.533
    5 9 0 25.563
    0 3 0 26.008
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {10: [1, 5], 7: [10, 13], 9: [1, 8], 5: [9], 0: [3, 11], 4: [1, 8], 2: [5, 10], 3: [2, 7], 1: [13, 12, 10, 5, 8, 3], 12: [5]}
  • Source: 13
  • Destination: 11
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 24.927
  • Adding a new virtual link from 13 to 11 .
  • A new virtual link (13, 11, 1) is created for queue 1 , request 60 , from Node13 to Node11 capacity requirement 24.927 Gbps, having free capacity 15.073 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 13 → 11 are = [11.259]
  • Capacities are [11.259]
  • que 1 req 60 (src 13 dst 11 num 1) type New capacity 24.927 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(13,11)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,11,1)[(1,60,24.927,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,11,1)[24.927,15.073,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,60)[(13,11,1,'New',24.927,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step243_Que1_Req60.html

    Time of processing all requests 706.455, Time of current queue's turn 6.455
    Step 244Processing queue 1request 61from Node11 (11)to Node12 (12) Remain 24.895 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 24.895 Gbps, to route the capacity requirement from Node11 to Node12
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 24.895 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 1 5
    7 10 13
    9 1 8
    5 9
    0 3 11
    4 1 8
    2 5 10
    3 2 7
    1 13 12 10 5 8 3
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 1 0 25.342
    7 10 0 25.506
    9 1 0 25.533
    5 9 0 25.563
    0 3 0 26.008
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {10: [1, 5], 7: [10, 13], 9: [1, 8], 5: [9], 0: [3, 11], 4: [1, 8], 2: [5, 10], 3: [2, 7], 1: [13, 12, 10, 5, 8, 3], 12: [5]}
  • Source: 11
  • Destination: 12
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 24.895
  • Adding a new virtual link from 11 to 12 .
  • A new virtual link (11, 12, 1) is created for queue 1 , request 61 , from Node11 to Node12 capacity requirement 24.895 Gbps, having free capacity 15.105 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 11 → 12 are = [16.628]
  • Capacities are [16.628]
  • que 1 req 61 (src 11 dst 12 num 1) type New capacity 24.895 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(11,12)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,12,1)[(1,61,24.895,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,12,1)[24.895,15.105,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,61)[(11,12,1,'New',24.895,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step244_Que1_Req61.html

    Time of processing all requests 715.777, Time of current queue's turn 15.777
    Step 245Processing queue 1request 62from Node0 (0)to Node3 (3) Remain 24.887 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 24.887 Gbps, to route the capacity requirement from Node0 to Node3
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 24.887 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 13.992 26.008 1
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 1 5
    7 10 13
    9 1 8
    5 9
    0 3 11
    4 1 8
    2 5 10
    3 2 7
    1 13 12 10 5 8 3
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 1 0 25.342
    7 10 0 25.506
    9 1 0 25.533
    5 9 0 25.563
    0 3 0 26.008
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {10: [1, 5], 7: [10, 13], 9: [1, 8], 5: [9], 0: [3, 11], 4: [1, 8], 2: [5, 10], 3: [2, 7], 1: [13, 12, 10, 5, 8, 3], 12: [5]}
  • Source: 0
  • Destination: 3
  • All paths [0, 3] .
  • Processing path [0, 3]
  • Path2links [[0, 3]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[0, 3]]
  • Subtract the utilised capacity from the Link's [0, 3] free capacity.
  • Update value is -24.887
  • Updated Virtual Link's (0,3,0) free capacity to 1.121.
  • que 1 req 62 (src 0 dst 3 num 0) type Grm capacity 24.887 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 62 VirtualLinkID: 139 (src: 0 dst: 3 ), Required Capacity: 24.887 Free Capacity (on the graph): 1.121 Free Capacity (on the corresponding array:) 1.121 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(0,3,0)[(0,138,13.992,'New'),(1,62,24.887,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,3,0)[38.879,1.121,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,62)[(0,3,0,'Grm',24.887,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step245_Que1_Req62.html

    Time of processing all requests 730.001, Time of current queue's turn 30.001
    Step 246Processing queue 1request 63from Node12 (12)to Node1 (1) Remain 24.854 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 24.854 Gbps, to route the capacity requirement from Node12 to Node1
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 24.854 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 14.467 25.533 1
    5 9 0 14.437 25.563 1
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 6.217 33.783 1
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 1 5
    7 10 13
    9 1 8
    5 9
    4 1 8
    0 11
    2 5 10
    3 2 7
    1 13 12 10 5 8 3
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 1 0 25.342
    7 10 0 25.506
    9 1 0 25.533
    5 9 0 25.563
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    12 5 0 33.783
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {10: [1, 5], 7: [10, 13], 9: [1, 8], 5: [9], 4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 1: [13, 12, 10, 5, 8, 3], 12: [5]}
  • Source: 12
  • Destination: 1
  • All paths [12, 5, 9, 1] .
  • Processing path [12, 5, 9, 1]
  • Path2links [[12, 5], [5, 9], [9, 1]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[12, 5], [5, 9], [9, 1]]
  • Subtract the utilised capacity from the Link's [12, 5] free capacity.
  • Update value is -24.854
  • Updated Virtual Link's (12,5,0) free capacity to 8.929.
  • que 1 req 63 (src 12 dst 5 num 0) type Grm capacity 24.854 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 63 VirtualLinkID: 177 (src: 12 dst: 5 ), Required Capacity: 24.854 Free Capacity (on the graph): 8.929 Free Capacity (on the corresponding array:) 8.929 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [5, 9] free capacity.
  • Update value is -24.854
  • Updated Virtual Link's (5,9,0) free capacity to 0.709.
  • que 1 req 63 (src 5 dst 9 num 0) type Grm capacity 24.854 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 63 VirtualLinkID: 138 (src: 5 dst: 9 ), Required Capacity: 24.854 Free Capacity (on the graph): 0.709 Free Capacity (on the corresponding array:) 0.709 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [9, 1] free capacity.
  • Update value is -24.854
  • Updated Virtual Link's (9,1,0) free capacity to 0.679.
  • que 1 req 63 (src 9 dst 1 num 0) type Grm capacity 24.854 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 63 VirtualLinkID: 137 (src: 9 dst: 1 ), Required Capacity: 24.854 Free Capacity (on the graph): 0.679 Free Capacity (on the corresponding array:) 0.679 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,5,0)[(0,176,6.217,'New'),(1,63,24.854,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,5,0)[31.071,8.929,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,63)[(12,5,0,'Grm',24.854,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(5,9,0)[(0,137,14.437,'New'),(1,63,24.854,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,9,0)[39.291,0.709,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,63)[(12,5,0,'Grm',24.854,0,0),(5,9,0,'Grm',24.854,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(9,1,0)[(0,136,14.467,'New'),(1,63,24.854,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,1,0)[39.321,0.679,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,63)[(12,5,0,'Grm',24.854,0,0),(5,9,0,'Grm',24.854,0,1),(9,1,0,'Grm',24.854,0,2)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step246_Que1_Req63.html

    Time of processing all requests 739.866, Time of current queue's turn 39.866
    Step 247Processing queue 1request 64from Node4 (4)to Node0 (0) Remain 24.736 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 24.736 Gbps, to route the capacity requirement from Node4 to Node0
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 24.736 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 0 8
    10 1 5
    7 10 13
    4 1 8
    0 11
    2 5 10
    3 2 7
    1 13 12 10 5 8 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 0 0 24.821
    10 1 0 25.342
    7 10 0 25.506
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {9: [0, 8], 10: [1, 5], 7: [10, 13], 4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 1: [13, 12, 10, 5, 8, 3]}
  • Source: 4
  • Destination: 0
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 24.736
  • Adding a new virtual link from 4 to 0 .
  • A new virtual link (4, 0, 1) is created for queue 1 , request 64 , from Node4 to Node0 capacity requirement 24.736 Gbps, having free capacity 15.264 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 4 → 0 are = [0.074]
  • Capacities are [0.074]
  • que 1 req 64 (src 4 dst 0 num 1) type New capacity 24.736 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(4,0)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,0,1)[(1,64,24.736,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,0,1)[24.736,15.264,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,64)[(4,0,1,'New',24.736,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step247_Que1_Req64.html

    Time of processing all requests 757.420, Time of current queue's turn 57.420
    Step 248Processing queue 1request 65from Node9 (9)to Node3 (3) Remain 24.628 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 24.628 Gbps, to route the capacity requirement from Node9 to Node3
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 24.628 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 0 8
    10 1 5
    7 10 13
    4 1 8
    0 11
    2 5 10
    3 2 7
    1 13 12 10 5 8 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 0 0 24.821
    10 1 0 25.342
    7 10 0 25.506
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {9: [0, 8], 10: [1, 5], 7: [10, 13], 4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 1: [13, 12, 10, 5, 8, 3]}
  • Source: 9
  • Destination: 3
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 24.628
  • Adding a new virtual link from 9 to 3 .
  • A new virtual link (9, 3, 1) is created for queue 1 , request 65 , from Node9 to Node3 capacity requirement 24.628 Gbps, having free capacity 15.372 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 9 → 3 are = [18.188]
  • Capacities are [18.188]
  • que 1 req 65 (src 9 dst 3 num 1) type New capacity 24.628 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(9,3)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(9,3,1)[(1,65,24.628,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,3,1)[24.628,15.372,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,65)[(9,3,1,'New',24.628,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step248_Que1_Req65.html

    Time of processing all requests 767.300, Time of current queue's turn 67.300
    Step 249Processing queue 1request 66from Node10 (10)to Node12 (12) Remain 24.566 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 24.566 Gbps, to route the capacity requirement from Node10 to Node12
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 24.566 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 14.658 25.342 1
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 9.936 30.064 1
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    8 1
    9 0 8
    10 1 5
    7 10 13
    4 1 8
    0 11
    2 5 10
    3 2 7
    1 13 12 10 5 8 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    8 1 0 24.593
    9 0 0 24.821
    10 1 0 25.342
    7 10 0 25.506
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    1 12 0 30.064
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {8: [1], 9: [0, 8], 10: [1, 5], 7: [10, 13], 4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 1: [13, 12, 10, 5, 8, 3]}
  • Source: 10
  • Destination: 12
  • All paths [10, 1, 12] .
  • Processing path [10, 1, 12]
  • Path2links [[10, 1], [1, 12]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[10, 1], [1, 12]]
  • Subtract the utilised capacity from the Link's [10, 1] free capacity.
  • Update value is -24.566
  • Updated Virtual Link's (10,1,0) free capacity to 0.776.
  • que 1 req 66 (src 10 dst 1 num 0) type Grm capacity 24.566 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 66 VirtualLinkID: 135 (src: 10 dst: 1 ), Required Capacity: 24.566 Free Capacity (on the graph): 0.776 Free Capacity (on the corresponding array:) 0.776 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [1, 12] free capacity.
  • Update value is -24.566
  • Updated Virtual Link's (1,12,0) free capacity to 5.498.
  • que 1 req 66 (src 1 dst 12 num 0) type Grm capacity 24.566 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 66 VirtualLinkID: 157 (src: 1 dst: 12 ), Required Capacity: 24.566 Free Capacity (on the graph): 5.498 Free Capacity (on the corresponding array:) 5.498 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(10,1,0)[(0,134,14.658,'New'),(1,66,24.566,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,1,0)[39.224,0.776,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,66)[(10,1,0,'Grm',24.566,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,12,0)[(0,156,9.936,'New'),(1,66,24.566,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,12,0)[34.502,5.498,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,66)[(10,1,0,'Grm',24.566,0,0),(1,12,0,'Grm',24.566,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step249_Que1_Req66.html

    Time of processing all requests 781.649, Time of current queue's turn 81.649
    Step 250Processing queue 1request 67from Node6 (6)to Node2 (2) Remain 24.514 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 24.514 Gbps, to route the capacity requirement from Node6 to Node2
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 24.514 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    8 1
    9 0 8
    7 10 13
    10 5
    4 1 8
    0 11
    2 5 10
    3 2 7
    1 13 10 5 8 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    8 1 0 24.593
    9 0 0 24.821
    7 10 0 25.506
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {8: [1], 9: [0, 8], 7: [10, 13], 10: [5], 4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 1: [13, 10, 5, 8, 3]}
  • Source: 6
  • Destination: 2
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 24.514
  • Adding a new virtual link from 6 to 2 .
  • A new virtual link (6, 2, 1) is created for queue 1 , request 67 , from Node6 to Node2 capacity requirement 24.514 Gbps, having free capacity 15.486 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 6 → 2 are = [23.417]
  • Capacities are [23.417]
  • que 1 req 67 (src 6 dst 2 num 1) type New capacity 24.514 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(6,2)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,2,1)[(1,67,24.514,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,2,1)[24.514,15.486,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,67)[(6,2,1,'New',24.514,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step250_Que1_Req67.html

    Time of processing all requests 795.297, Time of current queue's turn 95.297
    Step 251Processing queue 1request 68from Node2 (2)to Node11 (11) Remain 24.083 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 24.083 Gbps, to route the capacity requirement from Node2 to Node11
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 24.083 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    12 6
    7 8 10 13
    10 6 5
    8 1
    9 0 8
    4 1 8
    0 11
    2 5 10
    3 2 7
    1 13 10 5 8 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    12 6 0 24.109
    7 8 0 24.253
    10 6 0 24.484
    8 1 0 24.593
    9 0 0 24.821
    7 10 0 25.506
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {12: [6], 7: [8, 10, 13], 10: [6, 5], 8: [1], 9: [0, 8], 4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 1: [13, 10, 5, 8, 3]}
  • Source: 2
  • Destination: 11
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 24.083
  • Adding a new virtual link from 2 to 11 .
  • A new virtual link (2, 11, 1) is created for queue 1 , request 68 , from Node2 to Node11 capacity requirement 24.083 Gbps, having free capacity 15.917 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 2 → 11 are = [16.632]
  • Capacities are [16.632]
  • que 1 req 68 (src 2 dst 11 num 1) type New capacity 24.083 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(2,11)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,11,1)[(1,68,24.083,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,11,1)[24.083,15.917,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,68)[(2,11,1,'New',24.083,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step251_Que1_Req68.html

    Time of processing all requests 805.265, Time of current queue's turn 5.265
    Step 252Processing queue 1request 69from Node4 (4)to Node12 (12) Remain 23.906 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 23.906 Gbps, to route the capacity requirement from Node4 to Node12
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 23.906 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 12 0 8
    12 6
    7 8 10 13
    10 6 5
    8 1
    4 1 8
    0 11
    2 5 10
    3 2 7
    1 13 10 5 8 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 12 0 24.08
    12 6 0 24.109
    7 8 0 24.253
    10 6 0 24.484
    8 1 0 24.593
    9 0 0 24.821
    7 10 0 25.506
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {9: [12, 0, 8], 12: [6], 7: [8, 10, 13], 10: [6, 5], 8: [1], 4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 1: [13, 10, 5, 8, 3]}
  • Source: 4
  • Destination: 12
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 23.906
  • Adding a new virtual link from 4 to 12 .
  • A new virtual link (4, 12, 1) is created for queue 1 , request 69 , from Node4 to Node12 capacity requirement 23.906 Gbps, having free capacity 16.094 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 4 → 12 are = [19.844]
  • Capacities are [19.844]
  • que 1 req 69 (src 4 dst 12 num 1) type New capacity 23.906 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(4,12)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(4,12,1)[(1,69,23.906,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,12,1)[23.906,16.094,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,69)[(4,12,1,'New',23.906,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step252_Que1_Req69.html

    Time of processing all requests 819.482, Time of current queue's turn 19.482
    Step 253Processing queue 1request 70from Node1 (1)to Node3 (3) Remain 23.399 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 23.399 Gbps, to route the capacity requirement from Node1 to Node3
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 23.399 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 5.227 34.773 1
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    11 0
    6 2 5
    12 1 6
    5 6
    9 12 0 8
    7 8 10 13
    10 6 5
    8 1
    4 1 8
    0 11
    2 5 10
    3 2 7
    1 13 10 5 8 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    11 0 0 23.407
    6 2 0 23.417
    12 1 0 23.512
    6 5 0 23.556
    5 6 0 23.753
    9 12 0 24.08
    12 6 0 24.109
    7 8 0 24.253
    10 6 0 24.484
    8 1 0 24.593
    9 0 0 24.821
    7 10 0 25.506
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    1 8 0 34.029
    1 3 0 34.773
  • [Finding shortest path with minimum hops] Input graph: {11: [0], 6: [2, 5], 12: [1, 6], 5: [6], 9: [12, 0, 8], 7: [8, 10, 13], 10: [6, 5], 8: [1], 4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 1: [13, 10, 5, 8, 3]}
  • Source: 1
  • Destination: 3
  • All paths [1, 3] .
  • Processing path [1, 3]
  • Path2links [[1, 3]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[1, 3]]
  • Subtract the utilised capacity from the Link's [1, 3] free capacity.
  • Update value is -23.399
  • Updated Virtual Link's (1,3,0) free capacity to 11.374.
  • que 1 req 70 (src 1 dst 3 num 0) type Grm capacity 23.399 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 70 VirtualLinkID: 182 (src: 1 dst: 3 ), Required Capacity: 23.399 Free Capacity (on the graph): 11.374 Free Capacity (on the corresponding array:) 11.374 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,3,0)[(0,181,5.227,'New'),(1,70,23.399,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,3,0)[28.626,11.374,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,70)[(1,3,0,'Grm',23.399,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step253_Que1_Req70.html

    Time of processing all requests 829.618, Time of current queue's turn 29.618
    Step 254Processing queue 1request 71from Node11 (11)to Node7 (7) Remain 23.399 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 23.399 Gbps, to route the capacity requirement from Node11 to Node7
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 23.399 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    11 0
    6 2 5
    12 1 6
    5 6
    9 12 0 8
    7 8 10 13
    10 6 5
    8 1
    4 1 8
    0 11
    2 5 10
    3 2 7
    1 13 10 5 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    11 0 0 23.407
    6 2 0 23.417
    12 1 0 23.512
    6 5 0 23.556
    5 6 0 23.753
    9 12 0 24.08
    12 6 0 24.109
    7 8 0 24.253
    10 6 0 24.484
    8 1 0 24.593
    9 0 0 24.821
    7 10 0 25.506
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {11: [0], 6: [2, 5], 12: [1, 6], 5: [6], 9: [12, 0, 8], 7: [8, 10, 13], 10: [6, 5], 8: [1], 4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 1: [13, 10, 5, 8]}
  • Source: 11
  • Destination: 7
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 23.399
  • Adding a new virtual link from 11 to 7 .
  • A new virtual link (11, 7, 1) is created for queue 1 , request 71 , from Node11 to Node7 capacity requirement 23.399 Gbps, having free capacity 16.601 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 11 → 7 are = [9.93]
  • Capacities are [9.93]
  • que 1 req 71 (src 11 dst 7 num 1) type New capacity 23.399 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(11,7)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,7,1)[(1,71,23.399,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,7,1)[23.399,16.601,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,71)[(11,7,1,'New',23.399,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step254_Que1_Req71.html

    Time of processing all requests 839.421, Time of current queue's turn 39.421
    Step 255Processing queue 1request 72from Node6 (6)to Node13 (13) Remain 23.393 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 23.393 Gbps, to route the capacity requirement from Node6 to Node13
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 23.393 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    11 0
    6 2 5
    12 1 6
    5 6
    9 12 0 8
    7 8 10 13
    10 6 5
    8 1
    4 1 8
    0 11
    2 5 10
    3 2 7
    1 13 10 5 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    11 0 0 23.407
    6 2 0 23.417
    12 1 0 23.512
    6 5 0 23.556
    5 6 0 23.753
    9 12 0 24.08
    12 6 0 24.109
    7 8 0 24.253
    10 6 0 24.484
    8 1 0 24.593
    9 0 0 24.821
    7 10 0 25.506
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {11: [0], 6: [2, 5], 12: [1, 6], 5: [6], 9: [12, 0, 8], 7: [8, 10, 13], 10: [6, 5], 8: [1], 4: [1, 8], 0: [11], 2: [5, 10], 3: [2, 7], 1: [13, 10, 5, 8]}
  • Source: 6
  • Destination: 13
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 23.393
  • Adding a new virtual link from 6 to 13 .
  • A new virtual link (6, 13, 1) is created for queue 1 , request 72 , from Node6 to Node13 capacity requirement 23.393 Gbps, having free capacity 16.607 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 6 → 13 are = [15.994]
  • Capacities are [15.994]
  • que 1 req 72 (src 6 dst 13 num 1) type New capacity 23.393 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(6,13)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,13,1)[(1,72,23.393,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,13,1)[23.393,16.607,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,72)[(6,13,1,'New',23.393,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step255_Que1_Req72.html

    Time of processing all requests 854.039, Time of current queue's turn 54.039
    Step 256Processing queue 1request 73from Node9 (9)to Node13 (13) Remain 23.112 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 23.112 Gbps, to route the capacity requirement from Node9 to Node13
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 23.112 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 16.488 23.512 1
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 15.92 24.08 1
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 10.18 29.82 1
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    3 0 2 7
    7 11 8 10 13
    11 0
    6 2 5
    12 1 6
    5 6
    9 12 0 8
    10 6 5
    8 1
    4 1 8
    0 11
    2 5 10
    1 13 10 5 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    6 2 0 23.417
    12 1 0 23.512
    6 5 0 23.556
    5 6 0 23.753
    9 12 0 24.08
    12 6 0 24.109
    7 8 0 24.253
    10 6 0 24.484
    8 1 0 24.593
    9 0 0 24.821
    7 10 0 25.506
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    1 13 0 29.82
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {3: [0, 2, 7], 7: [11, 8, 10, 13], 11: [0], 6: [2, 5], 12: [1, 6], 5: [6], 9: [12, 0, 8], 10: [6, 5], 8: [1], 4: [1, 8], 0: [11], 2: [5, 10], 1: [13, 10, 5, 8]}
  • Source: 9
  • Destination: 13
  • All paths [9, 12, 1, 13] .
  • Processing path [9, 12, 1, 13]
  • Path2links [[9, 12], [12, 1], [1, 13]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[9, 12], [12, 1], [1, 13]]
  • Subtract the utilised capacity from the Link's [9, 12] free capacity.
  • Update value is -23.112
  • Updated Virtual Link's (9,12,0) free capacity to 0.968.
  • que 1 req 73 (src 9 dst 12 num 0) type Grm capacity 23.112 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 73 VirtualLinkID: 129 (src: 9 dst: 12 ), Required Capacity: 23.112 Free Capacity (on the graph): 0.968 Free Capacity (on the corresponding array:) 0.968 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [12, 1] free capacity.
  • Update value is -23.112
  • Updated Virtual Link's (12,1,0) free capacity to 0.400.
  • que 1 req 73 (src 12 dst 1 num 0) type Grm capacity 23.112 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 73 VirtualLinkID: 126 (src: 12 dst: 1 ), Required Capacity: 23.112 Free Capacity (on the graph): 0.4 Free Capacity (on the corresponding array:) 0.4 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [1, 13] free capacity.
  • Update value is -23.112
  • Updated Virtual Link's (1,13,0) free capacity to 6.708.
  • que 1 req 73 (src 1 dst 13 num 0) type Grm capacity 23.112 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 73 VirtualLinkID: 155 (src: 1 dst: 13 ), Required Capacity: 23.112 Free Capacity (on the graph): 6.708 Free Capacity (on the corresponding array:) 6.708 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(9,12,0)[(0,128,15.920,'New'),(1,73,23.112,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,12,0)[39.032,0.968,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,73)[(9,12,0,'Grm',23.112,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,1,0)[(0,125,16.488,'New'),(1,73,23.112,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,1,0)[39.600,0.400,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,73)[(9,12,0,'Grm',23.112,0,0),(12,1,0,'Grm',23.112,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,13,0)[(0,154,10.180,'New'),(1,73,23.112,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,13,0)[33.292,6.708,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,73)[(9,12,0,'Grm',23.112,0,0),(12,1,0,'Grm',23.112,0,1),(1,13,0,'Grm',23.112,0,2)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step256_Que1_Req73.html

    Time of processing all requests 863.707, Time of current queue's turn 63.707
    Step 257Processing queue 1request 74from Node11 (11)to Node1 (1) Remain 23.021 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 23.021 Gbps, to route the capacity requirement from Node11 to Node1
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 23.021 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 39.6 0.4 2
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    3 0 2 7
    7 11 8 10 13
    11 0
    6 2 5
    5 6
    12 6
    10 6 5
    8 1
    9 0 8
    4 1 8
    0 11
    2 5 10
    1 10 5 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    6 2 0 23.417
    6 5 0 23.556
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    10 6 0 24.484
    8 1 0 24.593
    9 0 0 24.821
    7 10 0 25.506
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {3: [0, 2, 7], 7: [11, 8, 10, 13], 11: [0], 6: [2, 5], 5: [6], 12: [6], 10: [6, 5], 8: [1], 9: [0, 8], 4: [1, 8], 0: [11], 2: [5, 10], 1: [10, 5, 8]}
  • Source: 11
  • Destination: 1
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 23.021
  • Adding a new virtual link from 11 to 1 .
  • A new virtual link (11, 1, 1) is created for queue 1 , request 74 , from Node11 to Node1 capacity requirement 23.021 Gbps, having free capacity 16.979 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 11 → 1 are = [9.771]
  • Capacities are [9.771]
  • que 1 req 74 (src 11 dst 1 num 1) type New capacity 23.021 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(11,1)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,1,1)[(1,74,23.021,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,1,1)[23.021,16.979,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,74)[(11,1,1,'New',23.021,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step257_Que1_Req74.html

    Time of processing all requests 886.205, Time of current queue's turn 86.205
    Step 258Processing queue 1request 75from Node6 (6)to Node3 (3) Remain 22.947 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 22.947 Gbps, to route the capacity requirement from Node6 to Node3
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 22.947 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 39.6 0.4 2
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    3 11 0 2 7
    7 11 8 10 13
    11 0
    6 2 5
    5 6
    12 6
    10 6 5
    8 1
    9 0 8
    4 1 8
    0 11
    2 5 10
    1 10 5 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    6 2 0 23.417
    6 5 0 23.556
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    10 6 0 24.484
    8 1 0 24.593
    9 0 0 24.821
    7 10 0 25.506
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {3: [11, 0, 2, 7], 7: [11, 8, 10, 13], 11: [0], 6: [2, 5], 5: [6], 12: [6], 10: [6, 5], 8: [1], 9: [0, 8], 4: [1, 8], 0: [11], 2: [5, 10], 1: [10, 5, 8]}
  • Source: 6
  • Destination: 3
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 22.947
  • Adding a new virtual link from 6 to 3 .
  • A new virtual link (6, 3, 1) is created for queue 1 , request 75 , from Node6 to Node3 capacity requirement 22.947 Gbps, having free capacity 17.053 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 6 → 3 are = [16.172]
  • Capacities are [16.172]
  • que 1 req 75 (src 6 dst 3 num 1) type New capacity 22.947 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(6,3)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,3,1)[(1,75,22.947,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,3,1)[22.947,17.053,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,75)[(6,3,1,'New',22.947,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step258_Que1_Req75.html

    Time of processing all requests 896.197, Time of current queue's turn 96.197
    Step 259Processing queue 1request 76from Node1 (1)to Node5 (5) Remain 22.818 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 22.818 Gbps, to route the capacity requirement from Node1 to Node5
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 22.818 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 39.6 0.4 2
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 6.378 33.622 1
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    3 11 0 2 7
    7 11 8 10 13
    11 0
    6 2 5
    5 6
    12 6
    10 6 5
    8 1
    9 0 8
    4 1 8
    0 11
    2 5 10
    1 10 5 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    6 2 0 23.417
    6 5 0 23.556
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    10 6 0 24.484
    8 1 0 24.593
    9 0 0 24.821
    7 10 0 25.506
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 5 0 33.622
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {3: [11, 0, 2, 7], 7: [11, 8, 10, 13], 11: [0], 6: [2, 5], 5: [6], 12: [6], 10: [6, 5], 8: [1], 9: [0, 8], 4: [1, 8], 0: [11], 2: [5, 10], 1: [10, 5, 8]}
  • Source: 1
  • Destination: 5
  • All paths [1, 5] .
  • Processing path [1, 5]
  • Path2links [[1, 5]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[1, 5]]
  • Subtract the utilised capacity from the Link's [1, 5] free capacity.
  • Update value is -22.818
  • Updated Virtual Link's (1,5,0) free capacity to 10.804.
  • que 1 req 76 (src 1 dst 5 num 0) type Grm capacity 22.818 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 76 VirtualLinkID: 176 (src: 1 dst: 5 ), Required Capacity: 22.818 Free Capacity (on the graph): 10.804 Free Capacity (on the corresponding array:) 10.804 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,5,0)[(0,175,6.378,'New'),(1,76,22.818,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,5,0)[29.196,10.804,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,76)[(1,5,0,'Grm',22.818,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step259_Que1_Req76.html

    Time of processing all requests 910.865, Time of current queue's turn 10.865
    Step 260Processing queue 1request 77from Node11 (11)to Node5 (5) Remain 22.667 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 22.667 Gbps, to route the capacity requirement from Node11 to Node5
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 22.667 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 39.6 0.4 2
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 5 0 8
    3 11 0 2 7
    7 11 8 10 13
    11 0
    6 2 5
    5 6
    12 6
    10 6 5
    8 1
    4 1 8
    0 11
    2 5 10
    1 10 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    6 2 0 23.417
    6 5 0 23.556
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    10 6 0 24.484
    8 1 0 24.593
    9 0 0 24.821
    7 10 0 25.506
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {9: [5, 0, 8], 3: [11, 0, 2, 7], 7: [11, 8, 10, 13], 11: [0], 6: [2, 5], 5: [6], 12: [6], 10: [6, 5], 8: [1], 4: [1, 8], 0: [11], 2: [5, 10], 1: [10, 8]}
  • Source: 11
  • Destination: 5
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 22.667
  • Adding a new virtual link from 11 to 5 .
  • A new virtual link (11, 5, 1) is created for queue 1 , request 77 , from Node11 to Node5 capacity requirement 22.667 Gbps, having free capacity 17.333 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 11 → 5 are = [17.645]
  • Capacities are [17.645]
  • que 1 req 77 (src 11 dst 5 num 1) type New capacity 22.667 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(11,5)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,5,1)[(1,77,22.667,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,5,1)[22.667,17.333,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,77)[(11,5,1,'New',22.667,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step260_Que1_Req77.html

    Time of processing all requests 920.700, Time of current queue's turn 20.700
    Step 261Processing queue 1request 78from Node2 (2)to Node3 (3) Remain 22.619 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 22.619 Gbps, to route the capacity requirement from Node2 to Node3
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 22.619 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 39.6 0.4 2
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 5 0 8
    3 11 0 2 7
    7 11 8 10 13
    11 0
    6 2 5
    5 6
    12 6
    10 6 5
    8 1
    4 1 8
    0 11
    2 5 10
    1 10 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    6 2 0 23.417
    6 5 0 23.556
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    10 6 0 24.484
    8 1 0 24.593
    9 0 0 24.821
    7 10 0 25.506
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {9: [5, 0, 8], 3: [11, 0, 2, 7], 7: [11, 8, 10, 13], 11: [0], 6: [2, 5], 5: [6], 12: [6], 10: [6, 5], 8: [1], 4: [1, 8], 0: [11], 2: [5, 10], 1: [10, 8]}
  • Source: 2
  • Destination: 3
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 22.619
  • Adding a new virtual link from 2 to 3 .
  • A new virtual link (2, 3, 1) is created for queue 1 , request 78 , from Node2 to Node3 capacity requirement 22.619 Gbps, having free capacity 17.381 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 2 → 3 are = [16.363]
  • Capacities are [16.363]
  • que 1 req 78 (src 2 dst 3 num 1) type New capacity 22.619 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(2,3)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(2,3,1)[(1,78,22.619,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,3,1)[22.619,17.381,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,78)[(2,3,1,'New',22.619,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step261_Que1_Req78.html

    Time of processing all requests 935.222, Time of current queue's turn 35.222
    Step 262Processing queue 1request 79from Node9 (9)to Node1 (1) Remain 22.372 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 22.372 Gbps, to route the capacity requirement from Node9 to Node1
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 22.372 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 39.6 0.4 2
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 15.407 24.593 1
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 13.938 26.062 1
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 5 0 8
    3 11 0 2 7
    7 11 8 10 13
    11 0
    6 2 5
    5 6
    12 6
    10 6 5
    8 1
    4 1 8
    0 11
    2 5 10
    1 10 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    6 2 0 23.417
    6 5 0 23.556
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    10 6 0 24.484
    8 1 0 24.593
    9 0 0 24.821
    7 10 0 25.506
    9 8 0 26.062
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {9: [5, 0, 8], 3: [11, 0, 2, 7], 7: [11, 8, 10, 13], 11: [0], 6: [2, 5], 5: [6], 12: [6], 10: [6, 5], 8: [1], 4: [1, 8], 0: [11], 2: [5, 10], 1: [10, 8]}
  • Source: 9
  • Destination: 1
  • All paths [9, 8, 1] .
  • Processing path [9, 8, 1]
  • Path2links [[9, 8], [8, 1]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[9, 8], [8, 1]]
  • Subtract the utilised capacity from the Link's [9, 8] free capacity.
  • Update value is -22.372
  • Updated Virtual Link's (9,8,0) free capacity to 3.690.
  • que 1 req 79 (src 9 dst 8 num 0) type Grm capacity 22.372 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 79 VirtualLinkID: 140 (src: 9 dst: 8 ), Required Capacity: 22.372 Free Capacity (on the graph): 3.69 Free Capacity (on the corresponding array:) 3.69 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [8, 1] free capacity.
  • Update value is -22.372
  • Updated Virtual Link's (8,1,0) free capacity to 2.221.
  • que 1 req 79 (src 8 dst 1 num 0) type Grm capacity 22.372 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 79 VirtualLinkID: 133 (src: 8 dst: 1 ), Required Capacity: 22.372 Free Capacity (on the graph): 2.221 Free Capacity (on the corresponding array:) 2.221 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(9,8,0)[(0,139,13.938,'New'),(1,79,22.372,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,8,0)[36.310,3.690,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,79)[(9,8,0,'Grm',22.372,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,1,0)[(0,132,15.407,'New'),(1,79,22.372,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,1,0)[37.779,2.221,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,79)[(9,8,0,'Grm',22.372,0,0),(8,1,0,'Grm',22.372,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step262_Que1_Req79.html

    Time of processing all requests 945.174, Time of current queue's turn 45.174
    Step 263Processing queue 1request 80from Node6 (6)to Node5 (5) Remain 22.299 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 22.299 Gbps, to route the capacity requirement from Node6 to Node5
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 22.299 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 39.6 0.4 2
    6 5 0 16.444 23.556 1
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 5 0
    3 11 0 2 7
    7 11 8 10 13
    11 0
    6 2 5
    5 6
    12 6
    10 6 5
    4 1 8
    0 11
    2 5 10
    1 10 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    6 2 0 23.417
    6 5 0 23.556
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    10 6 0 24.484
    9 0 0 24.821
    7 10 0 25.506
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {9: [5, 0], 3: [11, 0, 2, 7], 7: [11, 8, 10, 13], 11: [0], 6: [2, 5], 5: [6], 12: [6], 10: [6, 5], 4: [1, 8], 0: [11], 2: [5, 10], 1: [10, 8]}
  • Source: 6
  • Destination: 5
  • All paths [6, 5] .
  • Processing path [6, 5]
  • Path2links [[6, 5]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[6, 5]]
  • Subtract the utilised capacity from the Link's [6, 5] free capacity.
  • Update value is -22.299
  • Updated Virtual Link's (6,5,0) free capacity to 1.257.
  • que 1 req 80 (src 6 dst 5 num 0) type Grm capacity 22.299 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 80 VirtualLinkID: 127 (src: 6 dst: 5 ), Required Capacity: 22.299 Free Capacity (on the graph): 1.257 Free Capacity (on the corresponding array:) 1.257 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(6,5,0)[(0,126,16.444,'New'),(1,80,22.299,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,5,0)[38.743,1.257,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,80)[(6,5,0,'Grm',22.299,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step263_Que1_Req80.html

    Time of processing all requests 961.838, Time of current queue's turn 61.838
    Step 264Processing queue 1request 81from Node11 (11)to Node10 (10) Remain 22.283 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 22.283 Gbps, to route the capacity requirement from Node11 to Node10
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 22.283 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 5 0
    3 11 0 2 7
    7 11 8 10 13
    11 0
    6 2
    5 6
    12 6
    10 6 5
    4 1 8
    0 11
    2 5 10
    1 10 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    6 2 0 23.417
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    10 6 0 24.484
    9 0 0 24.821
    7 10 0 25.506
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {9: [5, 0], 3: [11, 0, 2, 7], 7: [11, 8, 10, 13], 11: [0], 6: [2], 5: [6], 12: [6], 10: [6, 5], 4: [1, 8], 0: [11], 2: [5, 10], 1: [10, 8]}
  • Source: 11
  • Destination: 10
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 22.283
  • Adding a new virtual link from 11 to 10 .
  • A new virtual link (11, 10, 1) is created for queue 1 , request 81 , from Node11 to Node10 capacity requirement 22.283 Gbps, having free capacity 17.717 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 11 → 10 are = [5.423]
  • Capacities are [5.423]
  • que 1 req 81 (src 11 dst 10 num 1) type New capacity 22.283 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(11,10)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,10,1)[(1,81,22.283,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,10,1)[22.283,17.717,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,81)[(11,10,1,'New',22.283,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step264_Que1_Req81.html

    Time of processing all requests 971.239, Time of current queue's turn 71.239
    Step 265Processing queue 1request 82from Node13 (13)to Node4 (4) Remain 22.24 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 22.24 Gbps, to route the capacity requirement from Node13 to Node4
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 22.24 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    0 4 11
    9 5 0
    3 11 0 2 7
    7 11 8 10 13
    11 0
    6 2
    5 6
    12 6
    10 6 5
    4 1 8
    2 5 10
    1 10 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    6 2 0 23.417
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    10 6 0 24.484
    9 0 0 24.821
    7 10 0 25.506
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {0: [4, 11], 9: [5, 0], 3: [11, 0, 2, 7], 7: [11, 8, 10, 13], 11: [0], 6: [2], 5: [6], 12: [6], 10: [6, 5], 4: [1, 8], 2: [5, 10], 1: [10, 8]}
  • Source: 13
  • Destination: 4
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 22.24
  • Adding a new virtual link from 13 to 4 .
  • A new virtual link (13, 4, 1) is created for queue 1 , request 82 , from Node13 to Node4 capacity requirement 22.24 Gbps, having free capacity 17.76 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 13 → 4 are = [11.175]
  • Capacities are [11.175]
  • que 1 req 82 (src 13 dst 4 num 1) type New capacity 22.240 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(13,4)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,4,1)[(1,82,22.240,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,4,1)[22.240,17.760,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,82)[(13,4,1,'New',22.240,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step265_Que1_Req82.html

    Time of processing all requests 982.156, Time of current queue's turn 82.156
    Step 266Processing queue 1request 83from Node10 (10)to Node2 (2) Remain 22.212 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 22.212 Gbps, to route the capacity requirement from Node10 to Node2
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 22.212 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 16.583 23.417 1
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 15.516 24.484 1
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    0 4 11
    9 5 0
    3 11 0 2 7
    7 11 8 10 13
    11 0
    6 2
    5 6
    12 6
    10 6 5
    4 1 8
    2 5 10
    1 10 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    6 2 0 23.417
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    10 6 0 24.484
    9 0 0 24.821
    7 10 0 25.506
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {0: [4, 11], 9: [5, 0], 3: [11, 0, 2, 7], 7: [11, 8, 10, 13], 11: [0], 6: [2], 5: [6], 12: [6], 10: [6, 5], 4: [1, 8], 2: [5, 10], 1: [10, 8]}
  • Source: 10
  • Destination: 2
  • All paths [10, 6, 2] .
  • Processing path [10, 6, 2]
  • Path2links [[10, 6], [6, 2]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[10, 6], [6, 2]]
  • Subtract the utilised capacity from the Link's [10, 6] free capacity.
  • Update value is -22.212
  • Updated Virtual Link's (10,6,0) free capacity to 2.272.
  • que 1 req 83 (src 10 dst 6 num 0) type Grm capacity 22.212 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 83 VirtualLinkID: 132 (src: 10 dst: 6 ), Required Capacity: 22.212 Free Capacity (on the graph): 2.272 Free Capacity (on the corresponding array:) 2.272 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [6, 2] free capacity.
  • Update value is -22.212
  • Updated Virtual Link's (6,2,0) free capacity to 1.205.
  • que 1 req 83 (src 6 dst 2 num 0) type Grm capacity 22.212 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 83 VirtualLinkID: 125 (src: 6 dst: 2 ), Required Capacity: 22.212 Free Capacity (on the graph): 1.205 Free Capacity (on the corresponding array:) 1.205 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(10,6,0)[(0,131,15.516,'New'),(1,83,22.212,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,6,0)[37.728,2.272,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,83)[(10,6,0,'Grm',22.212,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(6,2,0)[(0,124,16.583,'New'),(1,83,22.212,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,2,0)[38.795,1.205,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,83)[(10,6,0,'Grm',22.212,0,0),(6,2,0,'Grm',22.212,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step266_Que1_Req83.html

    Time of processing all requests 991.850, Time of current queue's turn 91.850
    Step 267Processing queue 1request 84from Node7 (7)to Node5 (5) Remain 22.092 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 22.092 Gbps, to route the capacity requirement from Node7 to Node5
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 22.092 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 14.494 25.506 1
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 13.448 26.552 1
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    0 4 11
    9 5 0
    3 11 0 2 7
    7 11 8 10 13
    11 0
    5 6
    12 6
    10 5
    4 1 8
    2 5 10
    1 10 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    7 10 0 25.506
    10 5 0 26.552
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {0: [4, 11], 9: [5, 0], 3: [11, 0, 2, 7], 7: [11, 8, 10, 13], 11: [0], 5: [6], 12: [6], 10: [5], 4: [1, 8], 2: [5, 10], 1: [10, 8]}
  • Source: 7
  • Destination: 5
  • All paths [7, 10, 5] .
  • Processing path [7, 10, 5]
  • Path2links [[7, 10], [10, 5]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[7, 10], [10, 5]]
  • Subtract the utilised capacity from the Link's [7, 10] free capacity.
  • Update value is -22.092
  • Updated Virtual Link's (7,10,0) free capacity to 3.414.
  • que 1 req 84 (src 7 dst 10 num 0) type Grm capacity 22.092 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 84 VirtualLinkID: 136 (src: 7 dst: 10 ), Required Capacity: 22.092 Free Capacity (on the graph): 3.414 Free Capacity (on the corresponding array:) 3.414 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [10, 5] free capacity.
  • Update value is -22.092
  • Updated Virtual Link's (10,5,0) free capacity to 4.460.
  • que 1 req 84 (src 10 dst 5 num 0) type Grm capacity 22.092 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 84 VirtualLinkID: 141 (src: 10 dst: 5 ), Required Capacity: 22.092 Free Capacity (on the graph): 4.46 Free Capacity (on the corresponding array:) 4.46 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(7,10,0)[(0,135,14.494,'New'),(1,84,22.092,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,10,0)[36.586,3.414,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,84)[(7,10,0,'Grm',22.092,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(10,5,0)[(0,140,13.448,'New'),(1,84,22.092,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,5,0)[35.540,4.460,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,84)[(7,10,0,'Grm',22.092,0,0),(10,5,0,'Grm',22.092,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step267_Que1_Req84.html

    Time of processing all requests 1008.828, Time of current queue's turn 8.828
    Step 268Processing queue 1request 85from Node1 (1)to Node12 (12) Remain 22.079 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 22.079 Gbps, to route the capacity requirement from Node1 to Node12
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 22.079 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    0 4 11
    9 5 0
    3 11 0 2 7
    7 11 8 13
    11 0
    5 6
    12 6
    4 1 8
    2 5 10
    1 10 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {0: [4, 11], 9: [5, 0], 3: [11, 0, 2, 7], 7: [11, 8, 13], 11: [0], 5: [6], 12: [6], 4: [1, 8], 2: [5, 10], 1: [10, 8]}
  • Source: 1
  • Destination: 12
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 22.079
  • Adding a new virtual link from 1 to 12 .
  • A new virtual link (1, 12, 1) is created for queue 1 , request 85 , from Node1 to Node12 capacity requirement 22.079 Gbps, having free capacity 17.921 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 1 → 12 are = [5.498]
  • Capacities are [5.498]
  • que 1 req 85 (src 1 dst 12 num 1) type New capacity 22.079 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(1,12)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(1,12,1)[(1,85,22.079,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,12,1)[22.079,17.921,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,85)[(1,12,1,'New',22.079,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step268_Que1_Req85.html

    Time of processing all requests 1024.193, Time of current queue's turn 24.193
    Step 269Processing queue 1request 86from Node11 (11)to Node3 (3) Remain 22.011 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 22.011 Gbps, to route the capacity requirement from Node11 to Node3
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 22.011 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    0 4 11
    9 5 0
    3 11 0 2 7
    7 11 8 13
    11 0
    5 6
    12 6
    4 1 8
    2 5 10
    1 10 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {0: [4, 11], 9: [5, 0], 3: [11, 0, 2, 7], 7: [11, 8, 13], 11: [0], 5: [6], 12: [6], 4: [1, 8], 2: [5, 10], 1: [10, 8]}
  • Source: 11
  • Destination: 3
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 22.011
  • Adding a new virtual link from 11 to 3 .
  • A new virtual link (11, 3, 1) is created for queue 1 , request 86 , from Node11 to Node3 capacity requirement 22.011 Gbps, having free capacity 17.989 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 11 → 3 are = [1.167]
  • Capacities are [1.167]
  • que 1 req 86 (src 11 dst 3 num 1) type New capacity 22.011 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(11,3)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(11,3,1)[(1,86,22.011,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,3,1)[22.011,17.989,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,86)[(11,3,1,'New',22.011,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step269_Que1_Req86.html

    Time of processing all requests 1034.111, Time of current queue's turn 34.111
    Step 270Processing queue 1request 87from Node8 (8)to Node9 (9) Remain 21.641 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 21.641 Gbps, to route the capacity requirement from Node8 to Node9
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 21.641 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    6 12
    10 3
    0 4 11
    9 5 0
    3 11 0 2 7
    7 11 8 13
    11 0
    5 6
    12 6
    4 1 8
    2 5 10
    1 10 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    6 12 0 21.808
    10 3 0 21.921
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {6: [12], 10: [3], 0: [4, 11], 9: [5, 0], 3: [11, 0, 2, 7], 7: [11, 8, 13], 11: [0], 5: [6], 12: [6], 4: [1, 8], 2: [5, 10], 1: [10, 8]}
  • Source: 8
  • Destination: 9
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 21.641
  • Adding a new virtual link from 8 to 9 .
  • A new virtual link (8, 9, 1) is created for queue 1 , request 87 , from Node8 to Node9 capacity requirement 21.641 Gbps, having free capacity 18.359 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 8 → 9 are = [5.49]
  • Capacities are [5.49]
  • que 1 req 87 (src 8 dst 9 num 1) type New capacity 21.641 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(8,9)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,9,1)[(1,87,21.641,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,9,1)[21.641,18.359,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,87)[(8,9,1,'New',21.641,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step270_Que1_Req87.html

    Time of processing all requests 1048.883, Time of current queue's turn 48.883
    Step 271Processing queue 1request 88from Node10 (10)to Node13 (13) Remain 21.436 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 21.436 Gbps, to route the capacity requirement from Node10 to Node13
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 21.436 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 18.079 21.921 1
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 10.357 29.643 1
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 7.901 32.099 1
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 1 5 10
    6 12
    10 3
    0 4 11
    9 5 0
    3 11 0 2 7
    7 11 8 13
    11 0
    5 6
    12 6
    4 1 8
    1 10 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 1 0 21.475
    6 12 0 21.808
    10 3 0 21.921
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    7 13 0 29.643
    2 10 0 30.362
    1 10 0 31.188
    3 7 0 32.099
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {2: [1, 5, 10], 6: [12], 10: [3], 0: [4, 11], 9: [5, 0], 3: [11, 0, 2, 7], 7: [11, 8, 13], 11: [0], 5: [6], 12: [6], 4: [1, 8], 1: [10, 8]}
  • Source: 10
  • Destination: 13
  • All paths [10, 3, 7, 13] .
  • Processing path [10, 3, 7, 13]
  • Path2links [[10, 3], [3, 7], [7, 13]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[10, 3], [3, 7], [7, 13]]
  • Subtract the utilised capacity from the Link's [10, 3] free capacity.
  • Update value is -21.436
  • Updated Virtual Link's (10,3,0) free capacity to 0.485.
  • que 1 req 88 (src 10 dst 3 num 0) type Grm capacity 21.436 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 88 VirtualLinkID: 118 (src: 10 dst: 3 ), Required Capacity: 21.436 Free Capacity (on the graph): 0.485 Free Capacity (on the corresponding array:) 0.485 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [3, 7] free capacity.
  • Update value is -21.436
  • Updated Virtual Link's (3,7,0) free capacity to 10.663.
  • que 1 req 88 (src 3 dst 7 num 0) type Grm capacity 21.436 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 88 VirtualLinkID: 171 (src: 3 dst: 7 ), Required Capacity: 21.436 Free Capacity (on the graph): 10.663 Free Capacity (on the corresponding array:) 10.663 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [7, 13] free capacity.
  • Update value is -21.436
  • Updated Virtual Link's (7,13,0) free capacity to 8.207.
  • que 1 req 88 (src 7 dst 13 num 0) type Grm capacity 21.436 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 88 VirtualLinkID: 154 (src: 7 dst: 13 ), Required Capacity: 21.436 Free Capacity (on the graph): 8.207 Free Capacity (on the corresponding array:) 8.207 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(10,3,0)[(0,117,18.079,'New'),(1,88,21.436,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,3,0)[39.515,0.485,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,88)[(10,3,0,'Grm',21.436,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,7,0)[(0,170,7.901,'New'),(1,88,21.436,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,7,0)[29.337,10.663,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,88)[(10,3,0,'Grm',21.436,0,0),(3,7,0,'Grm',21.436,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(7,13,0)[(0,153,10.357,'New'),(1,88,21.436,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,13,0)[31.793,8.207,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,88)[(10,3,0,'Grm',21.436,0,0),(3,7,0,'Grm',21.436,0,1),(7,13,0,'Grm',21.436,0,2)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step271_Que1_Req88.html

    Time of processing all requests 1059.102, Time of current queue's turn 59.102
    Step 272Processing queue 1request 89from Node1 (1)to Node2 (2) Remain 21.077 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 21.077 Gbps, to route the capacity requirement from Node1 to Node2
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 21.077 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 39.515 0.485 2
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 7
    2 1 5 10
    6 12
    0 4 11
    9 5 0
    3 11 0 2
    7 11 8
    11 0
    5 6
    12 6
    4 1 8
    1 10 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 7 0 21.256
    2 1 0 21.475
    6 12 0 21.808
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    2 10 0 30.362
    1 10 0 31.188
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {10: [7], 2: [1, 5, 10], 6: [12], 0: [4, 11], 9: [5, 0], 3: [11, 0, 2], 7: [11, 8], 11: [0], 5: [6], 12: [6], 4: [1, 8], 1: [10, 8]}
  • Source: 1
  • Destination: 2
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 21.077
  • Adding a new virtual link from 1 to 2 .
  • A new virtual link (1, 2, 1) is created for queue 1 , request 89 , from Node1 to Node2 capacity requirement 21.077 Gbps, having free capacity 18.923 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 1 → 2 are = [5.747]
  • Capacities are [5.747]
  • que 1 req 89 (src 1 dst 2 num 1) type New capacity 21.077 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(1,2)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(1,2,1)[(1,89,21.077,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,2,1)[21.077,18.923,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,89)[(1,2,1,'New',21.077,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step272_Que1_Req89.html

    Time of processing all requests 1081.921, Time of current queue's turn 81.921
    Step 273Processing queue 1request 90from Node6 (6)to Node0 (0) Remain 21.056 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 21.056 Gbps, to route the capacity requirement from Node6 to Node0
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 21.056 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 39.515 0.485 2
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 21.077 18.923 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 7
    2 1 5 10
    6 12
    0 4 11
    9 5 0
    3 11 0 2
    7 11 8
    11 0
    5 6
    12 6
    4 1 8
    1 10 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 7 0 21.256
    2 1 0 21.475
    6 12 0 21.808
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    2 10 0 30.362
    1 10 0 31.188
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {10: [7], 2: [1, 5, 10], 6: [12], 0: [4, 11], 9: [5, 0], 3: [11, 0, 2], 7: [11, 8], 11: [0], 5: [6], 12: [6], 4: [1, 8], 1: [10, 8]}
  • Source: 6
  • Destination: 0
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 21.056
  • Adding a new virtual link from 6 to 0 .
  • A new virtual link (6, 0, 1) is created for queue 1 , request 90 , from Node6 to Node0 capacity requirement 21.056 Gbps, having free capacity 18.944 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 6 → 0 are = [0.57]
  • Capacities are [0.57]
  • que 1 req 90 (src 6 dst 0 num 1) type New capacity 21.056 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(6,0)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,0,1)[(1,90,21.056,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,0,1)[21.056,18.944,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,90)[(6,0,1,'New',21.056,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step273_Que1_Req90.html

    Time of processing all requests 1092.382, Time of current queue's turn 92.382
    Step 274Processing queue 1request 91from Node13 (13)to Node2 (2) Remain 20.525 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 20.525 Gbps, to route the capacity requirement from Node13 to Node2
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 20.525 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 39.515 0.485 2
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 21.077 18.923 1
    6 0 1 21.056 18.944 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    12 2 6
    10 7
    2 1 5 10
    6 12
    0 4 11
    9 5 0
    3 11 0 2
    7 11 8
    11 0
    5 6
    4 1 8
    1 10 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    12 2 0 20.911
    10 7 0 21.256
    2 1 0 21.475
    6 12 0 21.808
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    2 10 0 30.362
    1 10 0 31.188
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {12: [2, 6], 10: [7], 2: [1, 5, 10], 6: [12], 0: [4, 11], 9: [5, 0], 3: [11, 0, 2], 7: [11, 8], 11: [0], 5: [6], 4: [1, 8], 1: [10, 8]}
  • Source: 13
  • Destination: 2
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 20.525
  • Adding a new virtual link from 13 to 2 .
  • A new virtual link (13, 2, 1) is created for queue 1 , request 91 , from Node13 to Node2 capacity requirement 20.525 Gbps, having free capacity 19.475 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 13 → 2 are = [14.463]
  • Capacities are [14.463]
  • que 1 req 91 (src 13 dst 2 num 1) type New capacity 20.525 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(13,2)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,2,1)[(1,91,20.525,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,2,1)[20.525,19.475,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,91)[(13,2,1,'New',20.525,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step274_Que1_Req91.html

    Time of processing all requests 1102.085, Time of current queue's turn 2.085
    Step 275Processing queue 1request 92from Node6 (6)to Node8 (8) Remain 20.407 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 20.407 Gbps, to route the capacity requirement from Node6 to Node8
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 20.407 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 19.089 20.911 1
    10 7 0 18.744 21.256 1
    2 1 0 18.525 21.475 1
    6 12 0 18.192 21.808 1
    10 3 0 39.515 0.485 2
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 5.971 34.029 1
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 21.077 18.923 1
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    12 2 6
    10 7
    2 1 5 10
    6 12
    0 4 11
    9 5 0
    3 11 0 2
    7 11 8
    11 0
    5 6
    4 1 8
    1 10 8
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    12 2 0 20.911
    10 7 0 21.256
    2 1 0 21.475
    6 12 0 21.808
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    2 10 0 30.362
    1 10 0 31.188
    1 8 0 34.029
  • [Finding shortest path with minimum hops] Input graph: {12: [2, 6], 10: [7], 2: [1, 5, 10], 6: [12], 0: [4, 11], 9: [5, 0], 3: [11, 0, 2], 7: [11, 8], 11: [0], 5: [6], 4: [1, 8], 1: [10, 8]}
  • Source: 6
  • Destination: 8
  • All paths [6, 12, 2, 1, 8] .
  • Processing path [6, 12, 2, 1, 8]
  • Path2links [[6, 12], [12, 2], [2, 1], [1, 8]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[6, 12], [12, 2], [2, 1], [1, 8]]
  • Subtract the utilised capacity from the Link's [6, 12] free capacity.
  • Update value is -20.407
  • Updated Virtual Link's (6,12,0) free capacity to 1.401.
  • que 1 req 92 (src 6 dst 12 num 0) type Grm capacity 20.407 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 92 VirtualLinkID: 117 (src: 6 dst: 12 ), Required Capacity: 20.407 Free Capacity (on the graph): 1.401 Free Capacity (on the corresponding array:) 1.401 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [12, 2] free capacity.
  • Update value is -20.407
  • Updated Virtual Link's (12,2,0) free capacity to 0.504.
  • que 1 req 92 (src 12 dst 2 num 0) type Grm capacity 20.407 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 92 VirtualLinkID: 114 (src: 12 dst: 2 ), Required Capacity: 20.407 Free Capacity (on the graph): 0.504 Free Capacity (on the corresponding array:) 0.504 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [2, 1] free capacity.
  • Update value is -20.407
  • Updated Virtual Link's (2,1,0) free capacity to 1.068.
  • que 1 req 92 (src 2 dst 1 num 0) type Grm capacity 20.407 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 92 VirtualLinkID: 116 (src: 2 dst: 1 ), Required Capacity: 20.407 Free Capacity (on the graph): 1.068 Free Capacity (on the corresponding array:) 1.068 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [1, 8] free capacity.
  • Update value is -20.407
  • Updated Virtual Link's (1,8,0) free capacity to 13.622.
  • que 1 req 92 (src 1 dst 8 num 0) type Grm capacity 20.407 step of routing reqquested traffic 0 step's virtual link sequence number 3
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 92 VirtualLinkID: 179 (src: 1 dst: 8 ), Required Capacity: 20.407 Free Capacity (on the graph): 13.622 Free Capacity (on the corresponding array:) 13.622 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(6,12,0)[(0,116,18.192,'New'),(1,92,20.407,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,12,0)[38.599,1.401,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,92)[(6,12,0,'Grm',20.407,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,2,0)[(0,113,19.089,'New'),(1,92,20.407,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,2,0)[39.496,0.504,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,92)[(6,12,0,'Grm',20.407,0,0),(12,2,0,'Grm',20.407,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(2,1,0)[(0,115,18.525,'New'),(1,92,20.407,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,1,0)[38.932,1.068,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,92)[(6,12,0,'Grm',20.407,0,0),(12,2,0,'Grm',20.407,0,1),(2,1,0,'Grm',20.407,0,2)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,8,0)[(0,178,5.971,'New'),(1,92,20.407,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,8,0)[26.378,13.622,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,92)[(6,12,0,'Grm',20.407,0,0),(12,2,0,'Grm',20.407,0,1),(2,1,0,'Grm',20.407,0,2),(1,8,0,'Grm',20.407,0,3)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step275_Que1_Req92.html

    Time of processing all requests 1117.370, Time of current queue's turn 17.370
    Step 276Processing queue 1request 93from Node8 (8)to Node13 (13) Remain 20.27 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 20.27 Gbps, to route the capacity requirement from Node8 to Node13
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 20.27 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 39.496 0.504 2
    10 7 0 18.744 21.256 1
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 21.077 18.923 1
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    6 1
    10 7
    0 4 11
    9 5 0
    3 11 0 2
    7 11 8
    11 0
    5 6
    12 6
    4 1 8
    2 5 10
    1 10
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    6 1 0 20.406
    10 7 0 21.256
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    2 10 0 30.362
    1 10 0 31.188
  • [Finding shortest path with minimum hops] Input graph: {6: [1], 10: [7], 0: [4, 11], 9: [5, 0], 3: [11, 0, 2], 7: [11, 8], 11: [0], 5: [6], 12: [6], 4: [1, 8], 2: [5, 10], 1: [10]}
  • Source: 8
  • Destination: 13
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 20.27
  • Adding a new virtual link from 8 to 13 .
  • A new virtual link (8, 13, 1) is created for queue 1 , request 93 , from Node8 to Node13 capacity requirement 20.27 Gbps, having free capacity 19.73 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 8 → 13 are = [0.03]
  • Capacities are [0.03]
  • que 1 req 93 (src 8 dst 13 num 1) type New capacity 20.270 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(8,13)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,13,1)[(1,93,20.270,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,13,1)[20.270,19.730,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,93)[(8,13,1,'New',20.270,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step276_Que1_Req93.html

    Time of processing all requests 1139.304, Time of current queue's turn 39.304
    Step 277Processing queue 1request 94from Node4 (4)to Node7 (7) Remain 20.125 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 20.125 Gbps, to route the capacity requirement from Node4 to Node7
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 20.125 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 39.496 0.504 2
    10 7 0 18.744 21.256 1
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 12.3 27.7 1
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 8.812 31.188 1
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 21.077 18.923 1
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 20.27 19.73 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 11 5 0
    6 1
    10 7
    0 4 11
    3 11 0 2
    7 11 8
    11 0
    5 6
    12 6
    4 1 8
    2 5 10
    1 10
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 11 0 20.197
    6 1 0 20.406
    10 7 0 21.256
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 1 0 27.7
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    2 10 0 30.362
    1 10 0 31.188
  • [Finding shortest path with minimum hops] Input graph: {9: [11, 5, 0], 6: [1], 10: [7], 0: [4, 11], 3: [11, 0, 2], 7: [11, 8], 11: [0], 5: [6], 12: [6], 4: [1, 8], 2: [5, 10], 1: [10]}
  • Source: 4
  • Destination: 7
  • All paths [4, 1, 10, 7] .
  • Processing path [4, 1, 10, 7]
  • Path2links [[4, 1], [1, 10], [10, 7]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[4, 1], [1, 10], [10, 7]]
  • Subtract the utilised capacity from the Link's [4, 1] free capacity.
  • Update value is -20.125
  • Updated Virtual Link's (4,1,0) free capacity to 7.575.
  • que 1 req 94 (src 4 dst 1 num 0) type Grm capacity 20.125 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 94 VirtualLinkID: 145 (src: 4 dst: 1 ), Required Capacity: 20.125 Free Capacity (on the graph): 7.575 Free Capacity (on the corresponding array:) 7.575 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [1, 10] free capacity.
  • Update value is -20.125
  • Updated Virtual Link's (1,10,0) free capacity to 11.063.
  • que 1 req 94 (src 1 dst 10 num 0) type Grm capacity 20.125 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 94 VirtualLinkID: 167 (src: 1 dst: 10 ), Required Capacity: 20.125 Free Capacity (on the graph): 11.063 Free Capacity (on the corresponding array:) 11.063 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [10, 7] free capacity.
  • Update value is -20.125
  • Updated Virtual Link's (10,7,0) free capacity to 1.131.
  • que 1 req 94 (src 10 dst 7 num 0) type Grm capacity 20.125 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 94 VirtualLinkID: 115 (src: 10 dst: 7 ), Required Capacity: 20.125 Free Capacity (on the graph): 1.131 Free Capacity (on the corresponding array:) 1.131 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(4,1,0)[(0,144,12.300,'New'),(1,94,20.125,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,1,0)[32.425,7.575,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,94)[(4,1,0,'Grm',20.125,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,10,0)[(0,166,8.812,'New'),(1,94,20.125,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,10,0)[28.937,11.063,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,94)[(4,1,0,'Grm',20.125,0,0),(1,10,0,'Grm',20.125,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(10,7,0)[(0,114,18.744,'New'),(1,94,20.125,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,7,0)[38.869,1.131,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,94)[(4,1,0,'Grm',20.125,0,0),(1,10,0,'Grm',20.125,0,1),(10,7,0,'Grm',20.125,0,2)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step277_Que1_Req94.html

    Time of processing all requests 1149.416, Time of current queue's turn 49.416
    Step 278Processing queue 1request 95from Node3 (3)to Node5 (5) Remain 19.86 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 19.86 Gbps, to route the capacity requirement from Node3 to Node5
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 19.86 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 10.878 29.122 1
    3 2 0 10.458 29.542 1
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 21.077 18.923 1
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 20.27 19.73 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    8 3
    9 11 5 0
    6 1
    0 4 11
    3 11 0 2
    7 11 8
    11 0
    5 6
    12 6
    4 8
    2 5 10
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    8 3 0 19.874
    9 11 0 20.197
    6 1 0 20.406
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 8 0 28.513
    0 11 0 28.835
    2 5 0 29.122
    3 2 0 29.542
    2 10 0 30.362
  • [Finding shortest path with minimum hops] Input graph: {8: [3], 9: [11, 5, 0], 6: [1], 0: [4, 11], 3: [11, 0, 2], 7: [11, 8], 11: [0], 5: [6], 12: [6], 4: [8], 2: [5, 10]}
  • Source: 3
  • Destination: 5
  • All paths [3, 2, 5] .
  • Processing path [3, 2, 5]
  • Path2links [[3, 2], [2, 5]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[3, 2], [2, 5]]
  • Subtract the utilised capacity from the Link's [3, 2] free capacity.
  • Update value is -19.86
  • Updated Virtual Link's (3,2,0) free capacity to 9.682.
  • que 1 req 95 (src 3 dst 2 num 0) type Grm capacity 19.860 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 95 VirtualLinkID: 153 (src: 3 dst: 2 ), Required Capacity: 19.86 Free Capacity (on the graph): 9.682 Free Capacity (on the corresponding array:) 9.682 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [2, 5] free capacity.
  • Update value is -19.86
  • Updated Virtual Link's (2,5,0) free capacity to 9.262.
  • que 1 req 95 (src 2 dst 5 num 0) type Grm capacity 19.860 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 95 VirtualLinkID: 152 (src: 2 dst: 5 ), Required Capacity: 19.86 Free Capacity (on the graph): 9.262 Free Capacity (on the corresponding array:) 9.262 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,2,0)[(0,152,10.458,'New'),(1,95,19.860,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,2,0)[30.318,9.682,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,95)[(3,2,0,'Grm',19.860,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(2,5,0)[(0,151,10.878,'New'),(1,95,19.860,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,5,0)[30.738,9.262,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,95)[(3,2,0,'Grm',19.860,0,0),(2,5,0,'Grm',19.860,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step278_Que1_Req95.html

    Time of processing all requests 1172.418, Time of current queue's turn 72.418
    Step 279Processing queue 1request 96from Node3 (3)to Node10 (10) Remain 19.744 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 19.744 Gbps, to route the capacity requirement from Node3 to Node10
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 19.744 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 21.077 18.923 1
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 20.27 19.73 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 12 8
    8 3
    9 11 5 0
    6 1
    0 4 11
    3 11 0
    7 11 8
    11 0
    5 6
    12 6
    2 10
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 12 0 19.844
    8 3 0 19.874
    9 11 0 20.197
    6 1 0 20.406
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 8 0 28.513
    0 11 0 28.835
    2 10 0 30.362
  • [Finding shortest path with minimum hops] Input graph: {4: [12, 8], 8: [3], 9: [11, 5, 0], 6: [1], 0: [4, 11], 3: [11, 0], 7: [11, 8], 11: [0], 5: [6], 12: [6], 2: [10]}
  • Source: 3
  • Destination: 10
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 19.744
  • Adding a new virtual link from 3 to 10 .
  • A new virtual link (3, 10, 1) is created for queue 1 , request 96 , from Node3 to Node10 capacity requirement 19.744 Gbps, having free capacity 20.256 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 3 → 10 are = [7.47]
  • Capacities are [7.47]
  • que 1 req 96 (src 3 dst 10 num 1) type New capacity 19.744 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(3,10)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,10,1)[(1,96,19.744,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,10,1)[19.744,20.256,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,96)[(3,10,1,'New',19.744,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step279_Que1_Req96.html

    Time of processing all requests 1186.674, Time of current queue's turn 86.674
    Step 280Processing queue 1request 97from Node0 (0)to Node5 (5) Remain 19.497 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 19.497 Gbps, to route the capacity requirement from Node0 to Node5
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 19.497 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 21.077 18.923 1
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 20.27 19.73 1
    3 10 1 19.744 20.256 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    12 4 6
    4 12 8
    8 3 13
    9 11 5 0
    6 1
    0 4 11
    3 11 0 10
    7 11 8
    11 0
    5 6
    2 10
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    12 4 0 19.738
    4 12 0 19.844
    8 3 0 19.874
    9 11 0 20.197
    6 1 0 20.406
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 8 0 28.513
    0 11 0 28.835
    2 10 0 30.362
    8 13 1 19.73
    3 10 1 20.256
  • [Finding shortest path with minimum hops] Input graph: {12: [4, 6], 4: [12, 8], 8: [3, 13], 9: [11, 5, 0], 6: [1], 0: [4, 11], 3: [11, 0, 10], 7: [11, 8], 11: [0], 5: [6], 2: [10]}
  • Source: 0
  • Destination: 5
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 19.497
  • Adding a new virtual link from 0 to 5 .
  • A new virtual link (0, 5, 1) is created for queue 1 , request 97 , from Node0 to Node5 capacity requirement 19.497 Gbps, having free capacity 20.503 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 0 → 5 are = [3.232]
  • Capacities are [3.232]
  • que 1 req 97 (src 0 dst 5 num 1) type New capacity 19.497 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(0,5)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(0,5,1)[(1,97,19.497,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,5,1)[19.497,20.503,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,97)[(0,5,1,'New',19.497,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step280_Que1_Req97.html

    Time of processing all requests 1197.015, Time of current queue's turn 97.015
    Step 281Processing queue 1request 98from Node3 (3)to Node0 (0) Remain 19.483 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 19.483 Gbps, to route the capacity requirement from Node3 to Node0
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 19.483 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 16.747 23.253 1
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 21.077 18.923 1
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 20.27 19.73 1
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    12 4 6
    4 12 8
    8 3 13
    9 11 5 0
    6 1
    0 4 11 5
    3 11 0 10
    7 11 8
    11 0
    5 6
    2 10
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    12 4 0 19.738
    4 12 0 19.844
    8 3 0 19.874
    9 11 0 20.197
    6 1 0 20.406
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    3 0 0 23.253
    7 11 0 23.29
    11 0 0 23.407
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 8 0 28.513
    0 11 0 28.835
    2 10 0 30.362
    8 13 1 19.73
    3 10 1 20.256
    0 5 1 20.503
  • [Finding shortest path with minimum hops] Input graph: {12: [4, 6], 4: [12, 8], 8: [3, 13], 9: [11, 5, 0], 6: [1], 0: [4, 11, 5], 3: [11, 0, 10], 7: [11, 8], 11: [0], 5: [6], 2: [10]}
  • Source: 3
  • Destination: 0
  • All paths [3, 0] .
  • Processing path [3, 0]
  • Path2links [[3, 0]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[3, 0]]
  • Subtract the utilised capacity from the Link's [3, 0] free capacity.
  • Update value is -19.483
  • Updated Virtual Link's (3,0,0) free capacity to 3.770.
  • que 1 req 98 (src 3 dst 0 num 0) type Grm capacity 19.483 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 98 VirtualLinkID: 122 (src: 3 dst: 0 ), Required Capacity: 19.483 Free Capacity (on the graph): 3.77 Free Capacity (on the corresponding array:) 3.77 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,0,0)[(0,121,16.747,'New'),(1,98,19.483,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,0,0)[36.230,3.770,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,98)[(3,0,0,'Grm',19.483,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step281_Que1_Req98.html

    Time of processing all requests 1212.000, Time of current queue's turn 12.000
    Step 282Processing queue 1request 99from Node11 (11)to Node4 (4) Remain 19.476 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 19.476 Gbps, to route the capacity requirement from Node11 to Node4
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 19.476 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 17.721 22.279 1
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 16.593 23.407 1
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 21.077 18.923 1
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 20.27 19.73 1
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    12 4 6
    4 12 8
    8 3 13
    9 11 5 0
    6 1
    0 4 11 5
    3 11 10
    7 11 8
    11 0
    5 6
    2 10
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    12 4 0 19.738
    4 12 0 19.844
    8 3 0 19.874
    9 11 0 20.197
    6 1 0 20.406
    0 4 0 22.279
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    11 0 0 23.407
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 8 0 28.513
    0 11 0 28.835
    2 10 0 30.362
    8 13 1 19.73
    3 10 1 20.256
    0 5 1 20.503
  • [Finding shortest path with minimum hops] Input graph: {12: [4, 6], 4: [12, 8], 8: [3, 13], 9: [11, 5, 0], 6: [1], 0: [4, 11, 5], 3: [11, 10], 7: [11, 8], 11: [0], 5: [6], 2: [10]}
  • Source: 11
  • Destination: 4
  • All paths [11, 0, 4] .
  • Processing path [11, 0, 4]
  • Path2links [[11, 0], [0, 4]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[11, 0], [0, 4]]
  • Subtract the utilised capacity from the Link's [11, 0] free capacity.
  • Update value is -19.476
  • Updated Virtual Link's (11,0,0) free capacity to 3.931.
  • que 1 req 99 (src 11 dst 0 num 0) type Grm capacity 19.476 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 99 VirtualLinkID: 124 (src: 11 dst: 0 ), Required Capacity: 19.476 Free Capacity (on the graph): 3.931 Free Capacity (on the corresponding array:) 3.931 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [0, 4] free capacity.
  • Update value is -19.476
  • Updated Virtual Link's (0,4,0) free capacity to 2.803.
  • que 1 req 99 (src 0 dst 4 num 0) type Grm capacity 19.476 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 99 VirtualLinkID: 119 (src: 0 dst: 4 ), Required Capacity: 19.476 Free Capacity (on the graph): 2.803 Free Capacity (on the corresponding array:) 2.803 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(11,0,0)[(0,123,16.593,'New'),(1,99,19.476,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,0,0)[36.069,3.931,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,99)[(11,0,0,'Grm',19.476,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(0,4,0)[(0,118,17.721,'New'),(1,99,19.476,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,4,0)[37.197,2.803,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,99)[(11,0,0,'Grm',19.476,0,0),(0,4,0,'Grm',19.476,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step282_Que1_Req99.html

    Time of processing all requests 1221.837, Time of current queue's turn 21.837
    Step 283Processing queue 1request 100from Node10 (10)to Node3 (3) Remain 19.468 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 19.468 Gbps, to route the capacity requirement from Node10 to Node3
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 19.468 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 21.077 18.923 1
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 20.27 19.73 1
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    12 4 6
    4 12 8
    8 3 13
    9 11 5 0
    6 1
    3 11 10
    7 11 8
    5 6
    0 11 5
    2 10
    13 2
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    12 4 0 19.738
    4 12 0 19.844
    8 3 0 19.874
    9 11 0 20.197
    6 1 0 20.406
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 8 0 28.513
    0 11 0 28.835
    2 10 0 30.362
    13 2 1 19.475
    8 13 1 19.73
    3 10 1 20.256
    0 5 1 20.503
  • [Finding shortest path with minimum hops] Input graph: {12: [4, 6], 4: [12, 8], 8: [3, 13], 9: [11, 5, 0], 6: [1], 3: [11, 10], 7: [11, 8], 5: [6], 0: [11, 5], 2: [10], 13: [2]}
  • Source: 10
  • Destination: 3
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 19.468
  • Adding a new virtual link from 10 to 3 .
  • A new virtual link (10, 3, 1) is created for queue 1 , request 100 , from Node10 to Node3 capacity requirement 19.468 Gbps, having free capacity 20.532 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 10 → 3 are = [0.485]
  • Capacities are [0.485]
  • que 1 req 100 (src 10 dst 3 num 1) type New capacity 19.468 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(10,3)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,3,1)[(1,100,19.468,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,3,1)[19.468,20.532,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,100)[(10,3,1,'New',19.468,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step283_Que1_Req100.html

    Time of processing all requests 1240.684, Time of current queue's turn 40.684
    Step 284Processing queue 1request 101from Node7 (7)to Node6 (6) Remain 19.464 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 19.464 Gbps, to route the capacity requirement from Node7 to Node6
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 19.464 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 21.077 18.923 1
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 20.27 19.73 1
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 19.468 20.532 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    12 4 6
    4 12 8
    8 3 13
    9 11 5 0
    6 1
    3 11 10
    7 11 8
    5 6
    0 11 5
    2 10
    13 2
    10 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    12 4 0 19.738
    4 12 0 19.844
    8 3 0 19.874
    9 11 0 20.197
    6 1 0 20.406
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 8 0 28.513
    0 11 0 28.835
    2 10 0 30.362
    13 2 1 19.475
    8 13 1 19.73
    3 10 1 20.256
    0 5 1 20.503
    10 3 1 20.532
  • [Finding shortest path with minimum hops] Input graph: {12: [4, 6], 4: [12, 8], 8: [3, 13], 9: [11, 5, 0], 6: [1], 3: [11, 10], 7: [11, 8], 5: [6], 0: [11, 5], 2: [10], 13: [2], 10: [3]}
  • Source: 7
  • Destination: 6
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 19.464
  • Adding a new virtual link from 7 to 6 .
  • A new virtual link (7, 6, 1) is created for queue 1 , request 101 , from Node7 to Node6 capacity requirement 19.464 Gbps, having free capacity 20.536 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 7 → 6 are = [12.866]
  • Capacities are [12.866]
  • que 1 req 101 (src 7 dst 6 num 1) type New capacity 19.464 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(7,6)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(7,6,1)[(1,101,19.464,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,6,1)[19.464,20.536,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,101)[(7,6,1,'New',19.464,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step284_Que1_Req101.html

    Time of processing all requests 1250.945, Time of current queue's turn 50.945
    Step 285Processing queue 1request 102from Node10 (10)to Node5 (5) Remain 19.406 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 19.406 Gbps, to route the capacity requirement from Node10 to Node5
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 19.406 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 21.077 18.923 1
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 20.27 19.73 1
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 19.468 20.532 1
    7 6 1 19.464 20.536 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 9 10
    12 4 6
    4 12 8
    8 3 13
    9 11 5 0
    6 1
    3 11 10
    7 11 8 6
    5 6
    0 11 5
    13 2
    10 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 9 0 19.445
    12 4 0 19.738
    4 12 0 19.844
    8 3 0 19.874
    9 11 0 20.197
    6 1 0 20.406
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 8 0 28.513
    0 11 0 28.835
    2 10 0 30.362
    13 2 1 19.475
    8 13 1 19.73
    3 10 1 20.256
    0 5 1 20.503
    10 3 1 20.532
    7 6 1 20.536
  • [Finding shortest path with minimum hops] Input graph: {2: [9, 10], 12: [4, 6], 4: [12, 8], 8: [3, 13], 9: [11, 5, 0], 6: [1], 3: [11, 10], 7: [11, 8, 6], 5: [6], 0: [11, 5], 13: [2], 10: [3]}
  • Source: 10
  • Destination: 5
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 19.406
  • Adding a new virtual link from 10 to 5 .
  • A new virtual link (10, 5, 1) is created for queue 1 , request 102 , from Node10 to Node5 capacity requirement 19.406 Gbps, having free capacity 20.594 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 10 → 5 are = [4.46]
  • Capacities are [4.46]
  • que 1 req 102 (src 10 dst 5 num 1) type New capacity 19.406 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(10,5)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(10,5,1)[(1,102,19.406,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,5,1)[19.406,20.594,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,102)[(10,5,1,'New',19.406,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step285_Que1_Req102.html

    Time of processing all requests 1265.899, Time of current queue's turn 65.899
    Step 286Processing queue 1request 103from Node2 (2)to Node0 (0) Remain 18.795 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 18.795 Gbps, to route the capacity requirement from Node2 to Node0
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 18.795 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 20.555 19.445 1
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 15.179 24.821 1
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 21.077 18.923 1
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 20.27 19.73 1
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 19.468 20.532 1
    7 6 1 19.464 20.536 1
    10 5 1 19.406 20.594 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    0 10 11 5
    5 10 0 6
    3 4 11 10
    9 10 11 5 0
    4 5 12 8
    1 11 2
    2 9 10
    12 4 6
    8 3 13
    6 1 0
    7 11 8 6
    13 2
    10 3 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    0 10 0 18.874
    5 10 0 18.904
    5 0 0 18.948
    3 4 0 19.334
    9 10 0 19.338
    4 5 0 19.354
    1 11 0 19.373
    2 9 0 19.445
    12 4 0 19.738
    4 12 0 19.844
    8 3 0 19.874
    9 11 0 20.197
    6 1 0 20.406
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    9 0 0 24.821
    4 8 0 28.513
    0 11 0 28.835
    2 10 0 30.362
    1 2 1 18.923
    6 0 1 18.944
    13 2 1 19.475
    8 13 1 19.73
    3 10 1 20.256
    0 5 1 20.503
    10 3 1 20.532
    7 6 1 20.536
    10 5 1 20.594
  • [Finding shortest path with minimum hops] Input graph: {0: [10, 11, 5], 5: [10, 0, 6], 3: [4, 11, 10], 9: [10, 11, 5, 0], 4: [5, 12, 8], 1: [11, 2], 2: [9, 10], 12: [4, 6], 8: [3, 13], 6: [1, 0], 7: [11, 8, 6], 13: [2], 10: [3, 5]}
  • Source: 2
  • Destination: 0
  • All paths [2, 9, 0] .
  • Processing path [2, 9, 0]
  • Path2links [[2, 9], [9, 0]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[2, 9], [9, 0]]
  • Subtract the utilised capacity from the Link's [2, 9] free capacity.
  • Update value is -18.795
  • Updated Virtual Link's (2,9,0) free capacity to 0.650.
  • que 1 req 103 (src 2 dst 9 num 0) type Grm capacity 18.795 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 103 VirtualLinkID: 108 (src: 2 dst: 9 ), Required Capacity: 18.795 Free Capacity (on the graph): 0.65 Free Capacity (on the corresponding array:) 0.65 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [9, 0] free capacity.
  • Update value is -18.795
  • Updated Virtual Link's (9,0,0) free capacity to 6.026.
  • que 1 req 103 (src 9 dst 0 num 0) type Grm capacity 18.795 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 103 VirtualLinkID: 134 (src: 9 dst: 0 ), Required Capacity: 18.795 Free Capacity (on the graph): 6.026 Free Capacity (on the corresponding array:) 6.026 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(2,9,0)[(0,107,20.555,'New'),(1,103,18.795,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,9,0)[39.350,0.650,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,103)[(2,9,0,'Grm',18.795,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(9,0,0)[(0,133,15.179,'New'),(1,103,18.795,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,0,0)[33.974,6.026,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,103)[(2,9,0,'Grm',18.795,0,0),(9,0,0,'Grm',18.795,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step286_Que1_Req103.html

    Time of processing all requests 1276.227, Time of current queue's turn 76.227
    Step 287Processing queue 1request 104from Node1 (1)to Node6 (6) Remain 18.229 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 18.229 Gbps, to route the capacity requirement from Node1 to Node6
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 18.229 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 39.35 0.65 2
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 16.247 23.753 1
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 9.638 30.362 1
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 21.077 18.923 1
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 20.27 19.73 1
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 19.468 20.532 1
    7 6 1 19.464 20.536 1
    10 5 1 19.406 20.594 1
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    0 6 10 11 5
    7 2 5 11 8 6
    2 13 10
    5 10 0 6
    3 4 11 10
    9 10 11 5
    4 5 12 8
    1 11 2
    12 4 6
    8 3 9 13
    6 1 0
    13 2
    10 3 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    0 6 0 18.526
    7 2 0 18.575
    2 13 0 18.738
    7 5 0 18.761
    0 10 0 18.874
    5 10 0 18.904
    5 0 0 18.948
    3 4 0 19.334
    9 10 0 19.338
    4 5 0 19.354
    1 11 0 19.373
    12 4 0 19.738
    4 12 0 19.844
    8 3 0 19.874
    9 11 0 20.197
    6 1 0 20.406
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    5 6 0 23.753
    12 6 0 24.109
    7 8 0 24.253
    4 8 0 28.513
    0 11 0 28.835
    2 10 0 30.362
    8 9 1 18.359
    1 2 1 18.923
    6 0 1 18.944
    13 2 1 19.475
    8 13 1 19.73
    3 10 1 20.256
    0 5 1 20.503
    10 3 1 20.532
    7 6 1 20.536
    10 5 1 20.594
  • [Finding shortest path with minimum hops] Input graph: {0: [6, 10, 11, 5], 7: [2, 5, 11, 8, 6], 2: [13, 10], 5: [10, 0, 6], 3: [4, 11, 10], 9: [10, 11, 5], 4: [5, 12, 8], 1: [11, 2], 12: [4, 6], 8: [3, 9, 13], 6: [1, 0], 13: [2], 10: [3, 5]}
  • Source: 1
  • Destination: 6
  • All paths [1, 2, 10, 5, 6] .
  • Processing path [1, 2, 10, 5, 6]
  • Path2links [[1, 2], [2, 10], [10, 5], [5, 6]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[1, 2], [2, 10], [10, 5], [5, 6]]
  • Subtract the utilised capacity from the Link's [1, 2] free capacity.
  • Update value is -18.229
  • Updated Virtual Link's (1,2,1) free capacity to 0.694.
  • que 1 req 104 (src 1 dst 2 num 1) type Grm capacity 18.229 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 104 VirtualLinkID: 65 (src: 1 dst: 2 ), Required Capacity: 18.229 Free Capacity (on the graph): 0.694 Free Capacity (on the corresponding array:) -12.482 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [2, 10] free capacity.
  • Update value is -18.229
  • Updated Virtual Link's (2,10,0) free capacity to 12.133.
  • que 1 req 104 (src 2 dst 10 num 0) type Grm capacity 18.229 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 104 VirtualLinkID: 159 (src: 2 dst: 10 ), Required Capacity: 18.229 Free Capacity (on the graph): 12.133 Free Capacity (on the corresponding array:) 12.133 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [10, 5] free capacity.
  • Update value is -18.229
  • Updated Virtual Link's (10,5,1) free capacity to 2.365.
  • que 1 req 104 (src 10 dst 5 num 1) type Grm capacity 18.229 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 104 VirtualLinkID: 141 (src: 10 dst: 5 ), Required Capacity: 18.229 Free Capacity (on the graph): 2.365 Free Capacity (on the corresponding array:) -13.769 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [5, 6] free capacity.
  • Update value is -18.229
  • Updated Virtual Link's (5,6,0) free capacity to 5.524.
  • que 1 req 104 (src 5 dst 6 num 0) type Grm capacity 18.229 step of routing reqquested traffic 0 step's virtual link sequence number 3
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 104 VirtualLinkID: 128 (src: 5 dst: 6 ), Required Capacity: 18.229 Free Capacity (on the graph): 5.524 Free Capacity (on the corresponding array:) 5.524 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,2,1)[(1,89,21.077,'New'),(1,104,18.229,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,2,1)[39.306,0.694,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,104)[(1,2,1,'Grm',18.229,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(2,10,0)[(0,158,9.638,'New'),(1,104,18.229,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,10,0)[27.867,12.133,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,104)[(1,2,1,'Grm',18.229,0,0),(2,10,0,'Grm',18.229,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(10,5,1)[(1,102,19.406,'New'),(1,104,18.229,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,5,1)[37.635,2.365,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,104)[(1,2,1,'Grm',18.229,0,0),(2,10,0,'Grm',18.229,0,1),(10,5,1,'Grm',18.229,0,2)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(5,6,0)[(0,127,16.247,'New'),(1,104,18.229,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,6,0)[34.476,5.524,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,104)[(1,2,1,'Grm',18.229,0,0),(2,10,0,'Grm',18.229,0,1),(10,5,1,'Grm',18.229,0,2),(5,6,0,'Grm',18.229,0,3)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step287_Que1_Req104.html

    Time of processing all requests 1290.523, Time of current queue's turn 90.523
    Step 288Processing queue 1request 105from Node7 (7)to Node8 (8) Remain 18.122 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 18.122 Gbps, to route the capacity requirement from Node7 to Node8
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 18.122 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 39.35 0.65 2
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 15.747 24.253 1
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 20.27 19.73 1
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 19.468 20.532 1
    7 6 1 19.464 20.536 1
    10 5 1 37.635 2.365 2
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    9 3 10 11 5
    3 13 4 11 10
    0 6 10 11 5
    7 2 5 11 8 6
    2 13
    5 10 0
    4 5 12 8
    1 11
    12 4 6
    8 3 9 13
    6 1 0
    13 2
    10 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    9 3 0 18.188
    3 13 0 18.222
    0 6 0 18.526
    7 2 0 18.575
    2 13 0 18.738
    7 5 0 18.761
    0 10 0 18.874
    5 10 0 18.904
    5 0 0 18.948
    3 4 0 19.334
    9 10 0 19.338
    4 5 0 19.354
    1 11 0 19.373
    12 4 0 19.738
    4 12 0 19.844
    8 3 0 19.874
    9 11 0 20.197
    6 1 0 20.406
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    12 6 0 24.109
    7 8 0 24.253
    4 8 0 28.513
    0 11 0 28.835
    8 9 1 18.359
    6 0 1 18.944
    13 2 1 19.475
    8 13 1 19.73
    3 10 1 20.256
    0 5 1 20.503
    10 3 1 20.532
    7 6 1 20.536
  • [Finding shortest path with minimum hops] Input graph: {9: [3, 10, 11, 5], 3: [13, 4, 11, 10], 0: [6, 10, 11, 5], 7: [2, 5, 11, 8, 6], 2: [13], 5: [10, 0], 4: [5, 12, 8], 1: [11], 12: [4, 6], 8: [3, 9, 13], 6: [1, 0], 13: [2], 10: [3]}
  • Source: 7
  • Destination: 8
  • All paths [7, 8] .
  • Processing path [7, 8]
  • Path2links [[7, 8]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[7, 8]]
  • Subtract the utilised capacity from the Link's [7, 8] free capacity.
  • Update value is -18.122
  • Updated Virtual Link's (7,8,0) free capacity to 6.131.
  • que 1 req 105 (src 7 dst 8 num 0) type Grm capacity 18.122 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 105 VirtualLinkID: 131 (src: 7 dst: 8 ), Required Capacity: 18.122 Free Capacity (on the graph): 6.131 Free Capacity (on the corresponding array:) 6.131 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(7,8,0)[(0,130,15.747,'New'),(1,105,18.122,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,8,0)[33.869,6.131,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,105)[(7,8,0,'Grm',18.122,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step288_Que1_Req105.html

    Time of processing all requests 1309.177, Time of current queue's turn 9.177
    Step 289Processing queue 1request 106from Node2 (2)to Node1 (1) Remain 17.542 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 17.542 Gbps, to route the capacity requirement from Node2 to Node1
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 17.542 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 21.262 18.738 1
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 39.35 0.65 2
    12 4 0 20.262 19.738 1
    4 12 0 20.156 19.844 1
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 19.594 20.406 1
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 15.891 24.109 1
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 22.24 17.76 1
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 20.27 19.73 1
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 19.468 20.532 1
    7 6 1 19.464 20.536 1
    10 5 1 37.635 2.365 2
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    11 5 10 3
    12 3 4 6
    6 8 1 0
    8 4 3 9 13
    9 3 10 11 5
    3 13 4 11 10
    0 6 10 11 5
    7 2 5 11 6
    2 13
    5 10 0
    4 5 12 8
    1 11 12
    13 4 2
    10 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    11 5 0 17.645
    12 3 0 17.647
    6 8 0 17.899
    8 4 0 17.931
    9 3 0 18.188
    3 13 0 18.222
    0 6 0 18.526
    7 2 0 18.575
    2 13 0 18.738
    7 5 0 18.761
    0 10 0 18.874
    5 10 0 18.904
    5 0 0 18.948
    3 4 0 19.334
    9 10 0 19.338
    4 5 0 19.354
    1 11 0 19.373
    12 4 0 19.738
    4 12 0 19.844
    8 3 0 19.874
    9 11 0 20.197
    6 1 0 20.406
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    12 6 0 24.109
    4 8 0 28.513
    0 11 0 28.835
    11 10 1 17.717
    13 4 1 17.76
    1 12 1 17.921
    11 3 1 17.989
    8 9 1 18.359
    6 0 1 18.944
    13 2 1 19.475
    8 13 1 19.73
    3 10 1 20.256
    0 5 1 20.503
    10 3 1 20.532
    7 6 1 20.536
  • [Finding shortest path with minimum hops] Input graph: {11: [5, 10, 3], 12: [3, 4, 6], 6: [8, 1, 0], 8: [4, 3, 9, 13], 9: [3, 10, 11, 5], 3: [13, 4, 11, 10], 0: [6, 10, 11, 5], 7: [2, 5, 11, 6], 2: [13], 5: [10, 0], 4: [5, 12, 8], 1: [11, 12], 13: [4, 2], 10: [3]}
  • Source: 2
  • Destination: 1
  • All paths [2, 13, 4, 12, 6, 1] .
  • Processing path [2, 13, 4, 12, 6, 1]
  • Path2links [[2, 13], [13, 4], [4, 12], [12, 6], [6, 1]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[2, 13], [13, 4], [4, 12], [12, 6], [6, 1]]
  • Subtract the utilised capacity from the Link's [2, 13] free capacity.
  • Update value is -17.542
  • Updated Virtual Link's (2,13,0) free capacity to 1.196.
  • que 1 req 106 (src 2 dst 13 num 0) type Grm capacity 17.542 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 106 VirtualLinkID: 99 (src: 2 dst: 13 ), Required Capacity: 17.542 Free Capacity (on the graph): 1.196 Free Capacity (on the corresponding array:) 1.196 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [13, 4] free capacity.
  • Update value is -17.542
  • Updated Virtual Link's (13,4,1) free capacity to 0.218.
  • que 1 req 106 (src 13 dst 4 num 1) type Grm capacity 17.542 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 106 VirtualLinkID: 61 (src: 13 dst: 4 ), Required Capacity: 17.542 Free Capacity (on the graph): 0.218 Free Capacity (on the corresponding array:) -6.367 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [4, 12] free capacity.
  • Update value is -17.542
  • Updated Virtual Link's (4,12,0) free capacity to 2.302.
  • que 1 req 106 (src 4 dst 12 num 0) type Grm capacity 17.542 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 106 VirtualLinkID: 110 (src: 4 dst: 12 ), Required Capacity: 17.542 Free Capacity (on the graph): 2.302 Free Capacity (on the corresponding array:) 2.302 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [12, 6] free capacity.
  • Update value is -17.542
  • Updated Virtual Link's (12,6,0) free capacity to 6.567.
  • que 1 req 106 (src 12 dst 6 num 0) type Grm capacity 17.542 step of routing reqquested traffic 0 step's virtual link sequence number 3
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 106 VirtualLinkID: 130 (src: 12 dst: 6 ), Required Capacity: 17.542 Free Capacity (on the graph): 6.567 Free Capacity (on the corresponding array:) 6.567 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [6, 1] free capacity.
  • Update value is -17.542
  • Updated Virtual Link's (6,1,0) free capacity to 2.864.
  • que 1 req 106 (src 6 dst 1 num 0) type Grm capacity 17.542 step of routing reqquested traffic 0 step's virtual link sequence number 4
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 106 VirtualLinkID: 113 (src: 6 dst: 1 ), Required Capacity: 17.542 Free Capacity (on the graph): 2.864 Free Capacity (on the corresponding array:) 2.864 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(2,13,0)[(0,98,21.262,'New'),(1,106,17.542,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,13,0)[38.804,1.196,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,106)[(2,13,0,'Grm',17.542,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(13,4,1)[(1,82,22.240,'New'),(1,106,17.542,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,4,1)[39.782,0.218,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,106)[(2,13,0,'Grm',17.542,0,0),(13,4,1,'Grm',17.542,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(4,12,0)[(0,109,20.156,'New'),(1,106,17.542,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,12,0)[37.698,2.302,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,106)[(2,13,0,'Grm',17.542,0,0),(13,4,1,'Grm',17.542,0,1),(4,12,0,'Grm',17.542,0,2)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,6,0)[(0,129,15.891,'New'),(1,106,17.542,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,6,0)[33.433,6.567,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,106)[(2,13,0,'Grm',17.542,0,0),(13,4,1,'Grm',17.542,0,1),(4,12,0,'Grm',17.542,0,2),(12,6,0,'Grm',17.542,0,3)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(6,1,0)[(0,112,19.594,'New'),(1,106,17.542,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,1,0)[37.136,2.864,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,106)[(2,13,0,'Grm',17.542,0,0),(13,4,1,'Grm',17.542,0,1),(4,12,0,'Grm',17.542,0,2),(12,6,0,'Grm',17.542,0,3),(6,1,0,'Grm',17.542,0,4)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step289_Que1_Req106.html

    Time of processing all requests 1318.117, Time of current queue's turn 18.117
    Step 290Processing queue 1request 107from Node6 (6)to Node12 (12) Remain 17.36 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 17.36 Gbps, to route the capacity requirement from Node6 to Node12
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 17.36 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 39.35 0.65 2
    12 4 0 20.262 19.738 1
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 20.27 19.73 1
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 19.468 20.532 1
    7 6 1 19.464 20.536 1
    10 5 1 37.635 2.365 2
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    11 5 10 3
    12 3 4
    6 8 0
    8 4 3 9 13
    9 3 10 11 5
    3 13 4 11 10
    0 6 10 11 5
    7 2 5 11 6
    5 10 0
    4 5 8
    1 11 12
    2 3
    13 2
    10 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    11 5 0 17.645
    12 3 0 17.647
    6 8 0 17.899
    8 4 0 17.931
    9 3 0 18.188
    3 13 0 18.222
    0 6 0 18.526
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    5 10 0 18.904
    5 0 0 18.948
    3 4 0 19.334
    9 10 0 19.338
    4 5 0 19.354
    1 11 0 19.373
    12 4 0 19.738
    8 3 0 19.874
    9 11 0 20.197
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    4 8 0 28.513
    0 11 0 28.835
    2 3 1 17.381
    11 10 1 17.717
    1 12 1 17.921
    11 3 1 17.989
    8 9 1 18.359
    6 0 1 18.944
    13 2 1 19.475
    8 13 1 19.73
    3 10 1 20.256
    0 5 1 20.503
    10 3 1 20.532
    7 6 1 20.536
  • [Finding shortest path with minimum hops] Input graph: {11: [5, 10, 3], 12: [3, 4], 6: [8, 0], 8: [4, 3, 9, 13], 9: [3, 10, 11, 5], 3: [13, 4, 11, 10], 0: [6, 10, 11, 5], 7: [2, 5, 11, 6], 5: [10, 0], 4: [5, 8], 1: [11, 12], 2: [3], 13: [2], 10: [3]}
  • Source: 6
  • Destination: 12
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 17.36
  • Adding a new virtual link from 6 to 12 .
  • A new virtual link (6, 12, 1) is created for queue 1 , request 107 , from Node6 to Node12 capacity requirement 17.36 Gbps, having free capacity 22.64 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 6 → 12 are = [1.401]
  • Capacities are [1.401]
  • que 1 req 107 (src 6 dst 12 num 1) type New capacity 17.360 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(6,12)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(6,12,1)[(1,107,17.360,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,12,1)[17.360,22.640,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,107)[(6,12,1,'New',17.360,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step290_Que1_Req107.html

    Time of processing all requests 1349.712, Time of current queue's turn 49.712
    Step 291Processing queue 1request 108from Node4 (4)to Node13 (13) Remain 17.237 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 17.237 Gbps, to route the capacity requirement from Node4 to Node13
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 17.237 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 39.35 0.65 2
    12 4 0 20.262 19.738 1
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 11.487 28.513 1
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 20.27 19.73 1
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 19.468 20.532 1
    7 6 1 19.464 20.536 1
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
  • Getting VL with max free capacity among VLs with common source destination {(11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (3, 13, 0): [18.222], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 10, 0): [18.904], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (1, 11, 0): [19.373], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (4, 8, 0): [28.513], (0, 11, 0): [28.835], (11, 5, 1): [17.333]}
  • List of VL ids with common source destination [(11, 5, 0), (11, 5, 1)]
    sdifreecapequal free capacities
    11 5 0 17.645
    11 5 1 17.333
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    12 3 4
    6 8 0 12
    8 4 3 9 13
    9 3 10 11 5
    3 13 4 11 10
    0 6 10 11 5
    7 2 5 11 6
    5 10 0
    4 5 8
    1 11 12
    11 5 10 3
    2 3
    13 2
    10 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    12 3 0 17.647
    6 8 0 17.899
    8 4 0 17.931
    9 3 0 18.188
    3 13 0 18.222
    0 6 0 18.526
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    5 10 0 18.904
    5 0 0 18.948
    3 4 0 19.334
    9 10 0 19.338
    4 5 0 19.354
    1 11 0 19.373
    12 4 0 19.738
    8 3 0 19.874
    9 11 0 20.197
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    4 8 0 28.513
    0 11 0 28.835
    11 5 1 17.333
    2 3 1 17.381
    11 10 1 17.717
    1 12 1 17.921
    11 3 1 17.989
    8 9 1 18.359
    6 0 1 18.944
    13 2 1 19.475
    8 13 1 19.73
    3 10 1 20.256
    0 5 1 20.503
    10 3 1 20.532
    7 6 1 20.536
    6 12 1 22.64
  • [Finding shortest path with minimum hops] Input graph: {12: [3, 4], 6: [8, 0, 12], 8: [4, 3, 9, 13], 9: [3, 10, 11, 5], 3: [13, 4, 11, 10], 0: [6, 10, 11, 5], 7: [2, 5, 11, 6], 5: [10, 0], 4: [5, 8], 1: [11, 12], 11: [5, 10, 3], 2: [3], 13: [2], 10: [3]}
  • Source: 4
  • Destination: 13
  • All paths [4, 8, 13] .
  • Processing path [4, 8, 13]
  • Path2links [[4, 8], [8, 13]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[4, 8], [8, 13]]
  • Subtract the utilised capacity from the Link's [4, 8] free capacity.
  • Update value is -17.237
  • Updated Virtual Link's (4,8,0) free capacity to 11.276.
  • que 1 req 108 (src 4 dst 8 num 0) type Grm capacity 17.237 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 108 VirtualLinkID: 147 (src: 4 dst: 8 ), Required Capacity: 17.237 Free Capacity (on the graph): 11.276 Free Capacity (on the corresponding array:) 11.276 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [8, 13] free capacity.
  • Update value is -17.237
  • Updated Virtual Link's (8,13,1) free capacity to 2.493.
  • que 1 req 108 (src 8 dst 13 num 1) type Grm capacity 17.237 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 108 VirtualLinkID: 156 (src: 8 dst: 13 ), Required Capacity: 17.237 Free Capacity (on the graph): 2.493 Free Capacity (on the corresponding array:) -17.207 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(4,8,0)[(0,146,11.487,'New'),(1,108,17.237,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,8,0)[28.724,11.276,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,108)[(4,8,0,'Grm',17.237,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,13,1)[(1,93,20.270,'New'),(1,108,17.237,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,13,1)[37.507,2.493,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,108)[(4,8,0,'Grm',17.237,0,0),(8,13,1,'Grm',17.237,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step291_Que1_Req108.html

    Time of processing all requests 1366.748, Time of current queue's turn 66.748
    Step 292Processing queue 1request 109from Node5 (5)to Node10 (10) Remain 16.49 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 16.49 Gbps, to route the capacity requirement from Node5 to Node10
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 16.49 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 21.096 18.904 1
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 39.35 0.65 2
    12 4 0 20.262 19.738 1
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 19.468 20.532 1
    7 6 1 19.464 20.536 1
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
  • Getting VL with max free capacity among VLs with common source destination {(12, 10, 0): [16.51], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (3, 13, 0): [18.222], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 10, 0): [18.904], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (1, 11, 0): [19.373], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (11, 7, 1): [16.601], (6, 13, 1): [16.607], (11, 1, 1): [16.979], (6, 3, 1): [17.053], (11, 5, 1): [17.333]}
  • List of VL ids with common source destination [(11, 5, 0), (11, 5, 1)]
    sdifreecapequal free capacities
    11 5 0 17.645
    11 5 1 17.333
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    12 10 3 4
    11 12 7 1 5 10 3
    2 11 3
    5 12 10 0
    4 10 5
    6 8 13 3 0 12
    8 4 3 9
    9 3 10 11 5
    3 13 4 11 10
    0 6 10 11 5
    7 2 5 11 6
    1 11 12
    13 2
    10 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    12 10 0 16.51
    11 12 0 16.628
    2 11 0 16.632
    5 12 0 16.887
    4 10 0 16.902
    12 3 0 17.647
    6 8 0 17.899
    8 4 0 17.931
    9 3 0 18.188
    3 13 0 18.222
    0 6 0 18.526
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    5 10 0 18.904
    5 0 0 18.948
    3 4 0 19.334
    9 10 0 19.338
    4 5 0 19.354
    1 11 0 19.373
    12 4 0 19.738
    8 3 0 19.874
    9 11 0 20.197
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    0 11 0 28.835
    11 7 1 16.601
    6 13 1 16.607
    11 1 1 16.979
    6 3 1 17.053
    11 5 1 17.333
    2 3 1 17.381
    11 10 1 17.717
    1 12 1 17.921
    11 3 1 17.989
    8 9 1 18.359
    6 0 1 18.944
    13 2 1 19.475
    3 10 1 20.256
    0 5 1 20.503
    10 3 1 20.532
    7 6 1 20.536
    6 12 1 22.64
  • [Finding shortest path with minimum hops] Input graph: {12: [10, 3, 4], 11: [12, 7, 1, 5, 10, 3], 2: [11, 3], 5: [12, 10, 0], 4: [10, 5], 6: [8, 13, 3, 0, 12], 8: [4, 3, 9], 9: [3, 10, 11, 5], 3: [13, 4, 11, 10], 0: [6, 10, 11, 5], 7: [2, 5, 11, 6], 1: [11, 12], 13: [2], 10: [3]}
  • Source: 5
  • Destination: 10
  • All paths [5, 10] .
  • Processing path [5, 10]
  • Path2links [[5, 10]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[5, 10]]
  • Subtract the utilised capacity from the Link's [5, 10] free capacity.
  • Update value is -16.49
  • Updated Virtual Link's (5,10,0) free capacity to 2.414.
  • que 1 req 109 (src 5 dst 10 num 0) type Grm capacity 16.490 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 109 VirtualLinkID: 102 (src: 5 dst: 10 ), Required Capacity: 16.49 Free Capacity (on the graph): 2.414 Free Capacity (on the corresponding array:) 2.414 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(5,10,0)[(0,101,21.096,'New'),(1,109,16.490,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,10,0)[37.586,2.414,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,109)[(5,10,0,'Grm',16.490,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step292_Que1_Req109.html

    Time of processing all requests 1382.833, Time of current queue's turn 82.833
    Step 293Processing queue 1request 110from Node1 (1)to Node10 (10) Remain 16.357 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 16.357 Gbps, to route the capacity requirement from Node1 to Node10
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 16.357 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 20.627 19.373 1
    2 9 0 39.35 0.65 2
    12 4 0 20.262 19.738 1
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 22.283 17.717 1
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 19.468 20.532 1
    7 6 1 19.464 20.536 1
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
  • Getting VL with max free capacity among VLs with common source destination {(2, 3, 0): [16.363], (12, 10, 0): [16.51], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (3, 13, 0): [18.222], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (1, 11, 0): [19.373], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (11, 7, 1): [16.601], (6, 13, 1): [16.607], (11, 1, 1): [16.979], (6, 3, 1): [17.053], (11, 5, 1): [17.333]}
  • List of VL ids with common source destination [(11, 5, 0), (11, 5, 1)]
    sdifreecapequal free capacities
    11 5 0 17.645
    11 5 1 17.333
  • Getting VL with max free capacity among VLs with common source destination {(2, 3, 0): [16.363], (12, 10, 0): [16.51], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (3, 13, 0): [18.222], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (1, 11, 0): [19.373], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (11, 7, 1): [16.601], (6, 13, 1): [16.607], (11, 1, 1): [16.979], (6, 3, 1): [17.053], (11, 5, 1): [17.333], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 3 11
    12 10 3 4
    11 12 7 1 5 10 3
    5 12 0
    4 10 5
    6 8 13 3 0 12
    8 4 3 9
    9 3 10 11 5
    3 13 4 11 10
    0 6 10 11 5
    7 2 5 11 6
    1 11 12
    13 2
    10 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 3 0 16.363
    12 10 0 16.51
    11 12 0 16.628
    2 11 0 16.632
    5 12 0 16.887
    4 10 0 16.902
    12 3 0 17.647
    6 8 0 17.899
    8 4 0 17.931
    9 3 0 18.188
    3 13 0 18.222
    0 6 0 18.526
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    5 0 0 18.948
    3 4 0 19.334
    9 10 0 19.338
    4 5 0 19.354
    1 11 0 19.373
    12 4 0 19.738
    8 3 0 19.874
    9 11 0 20.197
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    0 11 0 28.835
    11 7 1 16.601
    6 13 1 16.607
    11 1 1 16.979
    6 3 1 17.053
    11 5 1 17.333
    11 10 1 17.717
    1 12 1 17.921
    11 3 1 17.989
    8 9 1 18.359
    6 0 1 18.944
    13 2 1 19.475
    3 10 1 20.256
    0 5 1 20.503
    10 3 1 20.532
    7 6 1 20.536
    6 12 1 22.64
  • [Finding shortest path with minimum hops] Input graph: {2: [3, 11], 12: [10, 3, 4], 11: [12, 7, 1, 5, 10, 3], 5: [12, 0], 4: [10, 5], 6: [8, 13, 3, 0, 12], 8: [4, 3, 9], 9: [3, 10, 11, 5], 3: [13, 4, 11, 10], 0: [6, 10, 11, 5], 7: [2, 5, 11, 6], 1: [11, 12], 13: [2], 10: [3]}
  • Source: 1
  • Destination: 10
  • All paths [1, 11, 10] .
  • Processing path [1, 11, 10]
  • Path2links [[1, 11], [11, 10]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[1, 11], [11, 10]]
  • Subtract the utilised capacity from the Link's [1, 11] free capacity.
  • Update value is -16.357
  • Updated Virtual Link's (1,11,0) free capacity to 3.016.
  • que 1 req 110 (src 1 dst 11 num 0) type Grm capacity 16.357 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 110 VirtualLinkID: 107 (src: 1 dst: 11 ), Required Capacity: 16.357 Free Capacity (on the graph): 3.016 Free Capacity (on the corresponding array:) 3.016 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [11, 10] free capacity.
  • Update value is -16.357
  • Updated Virtual Link's (11,10,1) free capacity to 1.360.
  • que 1 req 110 (src 11 dst 10 num 1) type Grm capacity 16.357 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 110 VirtualLinkID: 60 (src: 11 dst: 10 ), Required Capacity: 16.357 Free Capacity (on the graph): 1.36 Free Capacity (on the corresponding array:) -10.934 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,11,0)[(0,106,20.627,'New'),(1,110,16.357,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,11,0)[36.984,3.016,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,110)[(1,11,0,'Grm',16.357,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(11,10,1)[(1,81,22.283,'New'),(1,110,16.357,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,10,1)[38.640,1.360,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,110)[(1,11,0,'Grm',16.357,0,0),(11,10,1,'Grm',16.357,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step293_Que1_Req110.html

    Time of processing all requests 1393.460, Time of current queue's turn 93.460
    Step 294Processing queue 1request 111from Node12 (12)to Node6 (6) Remain 15.867 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 15.867 Gbps, to route the capacity requirement from Node12 to Node6
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 15.867 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 23.731 16.269 1
    2 3 0 23.637 16.363 1
    12 10 0 23.49 16.51 1
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 20.262 19.738 1
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 23.399 16.601 1
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 19.468 20.532 1
    7 6 1 19.464 20.536 1
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (10, 11, 0): [16.269], (2, 3, 0): [16.363], (12, 10, 0): [16.51], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (3, 13, 0): [18.222], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917]}
  • List of VL ids with common source destination [(2, 11, 0), (2, 11, 1)]
    sdifreecapequal free capacities
    2 11 0 16.632
    2 11 1 15.917
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (10, 11, 0): [16.269], (2, 3, 0): [16.363], (12, 10, 0): [16.51], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (3, 13, 0): [18.222], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917], (4, 12, 1): [16.094], (11, 7, 1): [16.601], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (10, 11, 0): [16.269], (2, 3, 0): [16.363], (12, 10, 0): [16.51], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (3, 13, 0): [18.222], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917], (4, 12, 1): [16.094], (11, 7, 1): [16.601], (11, 1, 1): [16.979], (6, 3, 1): [17.053]}
  • List of VL ids with common source destination [(6, 3, 0), (6, 3, 1)]
    sdifreecapequal free capacities
    6 3 0 16.172
    6 3 1 17.053
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (10, 11, 0): [16.269], (2, 3, 0): [16.363], (12, 10, 0): [16.51], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (3, 13, 0): [18.222], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917], (4, 12, 1): [16.094], (11, 7, 1): [16.601], (11, 1, 1): [16.979], (11, 5, 1): [17.333]}
  • List of VL ids with common source destination [(11, 5, 0), (11, 5, 1)]
    sdifreecapequal free capacities
    11 5 0 17.645
    11 5 1 17.333
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (10, 11, 0): [16.269], (2, 3, 0): [16.363], (12, 10, 0): [16.51], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (3, 13, 0): [18.222], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917], (4, 12, 1): [16.094], (11, 7, 1): [16.601], (11, 1, 1): [16.979], (11, 5, 1): [17.333], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 13 11 3
    6 13 3 8 0 12
    2 3 11
    12 10 3 4
    11 12 7 1 5 3
    5 12 0
    4 10 5 12
    8 4 3 9
    9 3 10 11 5
    3 13 4 11 10
    0 6 10 11 5
    7 2 5 11 6
    1 12
    13 2
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 13 0 15.957
    6 13 0 15.994
    6 3 0 16.172
    10 11 0 16.269
    2 3 0 16.363
    12 10 0 16.51
    11 12 0 16.628
    5 12 0 16.887
    4 10 0 16.902
    12 3 0 17.647
    6 8 0 17.899
    8 4 0 17.931
    9 3 0 18.188
    3 13 0 18.222
    0 6 0 18.526
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    5 0 0 18.948
    3 4 0 19.334
    9 10 0 19.338
    4 5 0 19.354
    12 4 0 19.738
    8 3 0 19.874
    9 11 0 20.197
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    0 11 0 28.835
    2 11 1 15.917
    4 12 1 16.094
    11 7 1 16.601
    11 1 1 16.979
    11 5 1 17.333
    1 12 1 17.921
    11 3 1 17.989
    8 9 1 18.359
    6 0 1 18.944
    13 2 1 19.475
    3 10 1 20.256
    0 5 1 20.503
    10 3 1 20.532
    7 6 1 20.536
    6 12 1 22.64
  • [Finding shortest path with minimum hops] Input graph: {10: [13, 11, 3], 6: [13, 3, 8, 0, 12], 2: [3, 11], 12: [10, 3, 4], 11: [12, 7, 1, 5, 3], 5: [12, 0], 4: [10, 5, 12], 8: [4, 3, 9], 9: [3, 10, 11, 5], 3: [13, 4, 11, 10], 0: [6, 10, 11, 5], 7: [2, 5, 11, 6], 1: [12], 13: [2]}
  • Source: 12
  • Destination: 6
  • All paths [12, 10, 11, 7, 6] .
  • Processing path [12, 10, 11, 7, 6]
  • Path2links [[12, 10], [10, 11], [11, 7], [7, 6]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[12, 10], [10, 11], [11, 7], [7, 6]]
  • Subtract the utilised capacity from the Link's [12, 10] free capacity.
  • Update value is -15.867
  • Updated Virtual Link's (12,10,0) free capacity to 0.643.
  • que 1 req 111 (src 12 dst 10 num 0) type Grm capacity 15.867 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 111 VirtualLinkID: 86 (src: 12 dst: 10 ), Required Capacity: 15.867 Free Capacity (on the graph): 0.643 Free Capacity (on the corresponding array:) 0.643 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [10, 11] free capacity.
  • Update value is -15.867
  • Updated Virtual Link's (10,11,0) free capacity to 0.402.
  • que 1 req 111 (src 10 dst 11 num 0) type Grm capacity 15.867 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 111 VirtualLinkID: 84 (src: 10 dst: 11 ), Required Capacity: 15.867 Free Capacity (on the graph): 0.402 Free Capacity (on the corresponding array:) 0.402 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [11, 7] free capacity.
  • Update value is -15.867
  • Updated Virtual Link's (11,7,1) free capacity to 0.734.
  • que 1 req 111 (src 11 dst 7 num 1) type Grm capacity 15.867 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 111 VirtualLinkID: 54 (src: 11 dst: 7 ), Required Capacity: 15.867 Free Capacity (on the graph): 0.734 Free Capacity (on the corresponding array:) -5.937 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [7, 6] free capacity.
  • Update value is -15.867
  • Updated Virtual Link's (7,6,1) free capacity to 4.669.
  • que 1 req 111 (src 7 dst 6 num 1) type Grm capacity 15.867 step of routing reqquested traffic 0 step's virtual link sequence number 3
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 111 VirtualLinkID: 72 (src: 7 dst: 6 ), Required Capacity: 15.867 Free Capacity (on the graph): 4.669 Free Capacity (on the corresponding array:) -3.001 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,10,0)[(0,85,23.490,'New'),(1,111,15.867,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,10,0)[39.357,0.643,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,111)[(12,10,0,'Grm',15.867,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(10,11,0)[(0,83,23.731,'New'),(1,111,15.867,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,11,0)[39.598,0.402,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,111)[(12,10,0,'Grm',15.867,0,0),(10,11,0,'Grm',15.867,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(11,7,1)[(1,71,23.399,'New'),(1,111,15.867,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,7,1)[39.266,0.734,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,111)[(12,10,0,'Grm',15.867,0,0),(10,11,0,'Grm',15.867,0,1),(11,7,1,'Grm',15.867,0,2)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(7,6,1)[(1,101,19.464,'New'),(1,111,15.867,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,6,1)[35.331,4.669,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,111)[(12,10,0,'Grm',15.867,0,0),(10,11,0,'Grm',15.867,0,1),(11,7,1,'Grm',15.867,0,2),(7,6,1,'Grm',15.867,0,3)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step294_Que1_Req111.html

    Time of processing all requests 1413.600, Time of current queue's turn 13.600
    Step 295Processing queue 1request 112from Node11 (11)to Node2 (2) Remain 15.71 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 15.71 Gbps, to route the capacity requirement from Node11 to Node2
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 15.71 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 21.778 18.222 1
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 20.262 19.738 1
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 22.011 17.989 1
    8 9 1 21.641 18.359 1
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 20.525 19.475 1
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 19.468 20.532 1
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (3, 13, 0): [18.222], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917]}
  • List of VL ids with common source destination [(2, 11, 0), (2, 11, 1)]
    sdifreecapequal free capacities
    2 11 0 16.632
    2 11 1 15.917
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (3, 13, 0): [18.222], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (3, 13, 0): [18.222], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053]}
  • List of VL ids with common source destination [(6, 3, 0), (6, 3, 1)]
    sdifreecapequal free capacities
    6 3 0 16.172
    6 3 1 17.053
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (3, 13, 0): [18.222], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (11, 5, 1): [17.333]}
  • List of VL ids with common source destination [(11, 5, 0), (11, 5, 1)]
    sdifreecapequal free capacities
    11 5 0 17.645
    11 5 1 17.333
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (3, 13, 0): [18.222], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (11, 5, 1): [17.333], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 13 3
    6 13 3 8 0 12
    2 3 11
    11 12 1 5 3
    5 12 0
    4 10 5 12
    12 3 4
    8 4 3 9
    9 3 10 11 5
    3 13 4 11 10
    0 6 10 11 5
    7 2 5 11
    1 12
    13 2
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 13 0 15.957
    6 13 0 15.994
    6 3 0 16.172
    2 3 0 16.363
    11 12 0 16.628
    5 12 0 16.887
    4 10 0 16.902
    12 3 0 17.647
    6 8 0 17.899
    8 4 0 17.931
    9 3 0 18.188
    3 13 0 18.222
    0 6 0 18.526
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    5 0 0 18.948
    3 4 0 19.334
    9 10 0 19.338
    4 5 0 19.354
    12 4 0 19.738
    8 3 0 19.874
    9 11 0 20.197
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    0 11 0 28.835
    2 11 1 15.917
    4 12 1 16.094
    11 1 1 16.979
    11 5 1 17.333
    1 12 1 17.921
    11 3 1 17.989
    8 9 1 18.359
    6 0 1 18.944
    13 2 1 19.475
    3 10 1 20.256
    0 5 1 20.503
    10 3 1 20.532
    6 12 1 22.64
  • [Finding shortest path with minimum hops] Input graph: {10: [13, 3], 6: [13, 3, 8, 0, 12], 2: [3, 11], 11: [12, 1, 5, 3], 5: [12, 0], 4: [10, 5, 12], 12: [3, 4], 8: [4, 3, 9], 9: [3, 10, 11, 5], 3: [13, 4, 11, 10], 0: [6, 10, 11, 5], 7: [2, 5, 11], 1: [12], 13: [2]}
  • Source: 11
  • Destination: 2
  • All paths [11, 3, 13, 2] .
  • Processing path [11, 3, 13, 2]
  • Path2links [[11, 3], [3, 13], [13, 2]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[11, 3], [3, 13], [13, 2]]
  • Subtract the utilised capacity from the Link's [11, 3] free capacity.
  • Update value is -15.71
  • Updated Virtual Link's (11,3,1) free capacity to 2.279.
  • que 1 req 112 (src 11 dst 3 num 1) type Grm capacity 15.710 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 112 VirtualLinkID: 166 (src: 11 dst: 3 ), Required Capacity: 15.71 Free Capacity (on the graph): 2.279 Free Capacity (on the corresponding array:) -14.543 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [3, 13] free capacity.
  • Update value is -15.71
  • Updated Virtual Link's (3,13,0) free capacity to 2.512.
  • que 1 req 112 (src 3 dst 13 num 0) type Grm capacity 15.710 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 112 VirtualLinkID: 96 (src: 3 dst: 13 ), Required Capacity: 15.71 Free Capacity (on the graph): 2.512 Free Capacity (on the corresponding array:) 2.512 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [13, 2] free capacity.
  • Update value is -15.71
  • Updated Virtual Link's (13,2,1) free capacity to 3.765.
  • que 1 req 112 (src 13 dst 2 num 1) type Grm capacity 15.710 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 112 VirtualLinkID: 67 (src: 13 dst: 2 ), Required Capacity: 15.71 Free Capacity (on the graph): 3.765 Free Capacity (on the corresponding array:) -1.247 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(11,3,1)[(1,86,22.011,'New'),(1,112,15.710,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,3,1)[37.721,2.279,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,112)[(11,3,1,'Grm',15.710,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,13,0)[(0,95,21.778,'New'),(1,112,15.710,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,13,0)[37.488,2.512,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,112)[(11,3,1,'Grm',15.710,0,0),(3,13,0,'Grm',15.710,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(13,2,1)[(1,91,20.525,'New'),(1,112,15.710,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,2,1)[36.235,3.765,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,112)[(11,3,1,'Grm',15.710,0,0),(3,13,0,'Grm',15.710,0,1),(13,2,1,'Grm',15.710,0,2)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step295_Que1_Req112.html

    Time of processing all requests 1442.022, Time of current queue's turn 42.022
    Step 296Processing queue 1request 113from Node10 (10)to Node0 (0) Remain 15.679 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 15.679 Gbps, to route the capacity requirement from Node10 to Node0
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 15.679 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 21.052 18.948 1
    3 4 0 20.666 19.334 1
    9 10 0 20.662 19.338 1
    4 5 0 20.646 19.354 1
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 20.262 19.738 1
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 37.721 2.279 2
    8 9 1 21.641 18.359 1
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 19.468 20.532 1
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917]}
  • List of VL ids with common source destination [(2, 11, 0), (2, 11, 1)]
    sdifreecapequal free capacities
    2 11 0 16.632
    2 11 1 15.917
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053]}
  • List of VL ids with common source destination [(6, 3, 0), (6, 3, 1)]
    sdifreecapequal free capacities
    6 3 0 16.172
    6 3 1 17.053
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (11, 5, 1): [17.333]}
  • List of VL ids with common source destination [(11, 5, 0), (11, 5, 1)]
    sdifreecapequal free capacities
    11 5 0 17.645
    11 5 1 17.333
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (5, 0, 0): [18.948], (3, 4, 0): [19.334], (9, 10, 0): [19.338], (4, 5, 0): [19.354], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (11, 5, 1): [17.333], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 13 3
    6 13 3 8 0 12
    2 3 11
    11 12 1 5
    5 12 0
    4 10 5 12
    12 3 4
    8 4 3 9
    9 3 10 11 5
    0 6 10 11 5
    7 2 5 11
    3 4 11 10
    1 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 13 0 15.957
    6 13 0 15.994
    6 3 0 16.172
    2 3 0 16.363
    11 12 0 16.628
    5 12 0 16.887
    4 10 0 16.902
    12 3 0 17.647
    6 8 0 17.899
    8 4 0 17.931
    9 3 0 18.188
    0 6 0 18.526
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    5 0 0 18.948
    3 4 0 19.334
    9 10 0 19.338
    4 5 0 19.354
    12 4 0 19.738
    8 3 0 19.874
    9 11 0 20.197
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    0 11 0 28.835
    2 11 1 15.917
    4 12 1 16.094
    11 1 1 16.979
    11 5 1 17.333
    1 12 1 17.921
    8 9 1 18.359
    6 0 1 18.944
    3 10 1 20.256
    0 5 1 20.503
    10 3 1 20.532
    6 12 1 22.64
  • [Finding shortest path with minimum hops] Input graph: {10: [13, 3], 6: [13, 3, 8, 0, 12], 2: [3, 11], 11: [12, 1, 5], 5: [12, 0], 4: [10, 5, 12], 12: [3, 4], 8: [4, 3, 9], 9: [3, 10, 11, 5], 0: [6, 10, 11, 5], 7: [2, 5, 11], 3: [4, 11, 10], 1: [12]}
  • Source: 10
  • Destination: 0
  • All paths [10, 3, 4, 5, 0] .
  • Processing path [10, 3, 4, 5, 0]
  • Path2links [[10, 3], [3, 4], [4, 5], [5, 0]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[10, 3], [3, 4], [4, 5], [5, 0]]
  • Subtract the utilised capacity from the Link's [10, 3] free capacity.
  • Update value is -15.679
  • Updated Virtual Link's (10,3,1) free capacity to 4.853.
  • que 1 req 113 (src 10 dst 3 num 1) type Grm capacity 15.679 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 113 VirtualLinkID: 118 (src: 10 dst: 3 ), Required Capacity: 15.679 Free Capacity (on the graph): 4.853 Free Capacity (on the corresponding array:) -15.194 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [3, 4] free capacity.
  • Update value is -15.679
  • Updated Virtual Link's (3,4,0) free capacity to 3.655.
  • que 1 req 113 (src 3 dst 4 num 0) type Grm capacity 15.679 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 113 VirtualLinkID: 104 (src: 3 dst: 4 ), Required Capacity: 15.679 Free Capacity (on the graph): 3.655 Free Capacity (on the corresponding array:) 3.655 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [4, 5] free capacity.
  • Update value is -15.679
  • Updated Virtual Link's (4,5,0) free capacity to 3.675.
  • que 1 req 113 (src 4 dst 5 num 0) type Grm capacity 15.679 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 113 VirtualLinkID: 106 (src: 4 dst: 5 ), Required Capacity: 15.679 Free Capacity (on the graph): 3.675 Free Capacity (on the corresponding array:) 3.675 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [5, 0] free capacity.
  • Update value is -15.679
  • Updated Virtual Link's (5,0,0) free capacity to 3.269.
  • que 1 req 113 (src 5 dst 0 num 0) type Grm capacity 15.679 step of routing reqquested traffic 0 step's virtual link sequence number 3
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 113 VirtualLinkID: 103 (src: 5 dst: 0 ), Required Capacity: 15.679 Free Capacity (on the graph): 3.269 Free Capacity (on the corresponding array:) 3.269 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(10,3,1)[(1,100,19.468,'New'),(1,113,15.679,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,3,1)[35.147,4.853,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,113)[(10,3,1,'Grm',15.679,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,4,0)[(0,103,20.666,'New'),(1,113,15.679,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,4,0)[36.345,3.655,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,113)[(10,3,1,'Grm',15.679,0,0),(3,4,0,'Grm',15.679,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(4,5,0)[(0,105,20.646,'New'),(1,113,15.679,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,5,0)[36.325,3.675,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,113)[(10,3,1,'Grm',15.679,0,0),(3,4,0,'Grm',15.679,0,1),(4,5,0,'Grm',15.679,0,2)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(5,0,0)[(0,102,21.052,'New'),(1,113,15.679,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,0,0)[36.731,3.269,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,113)[(10,3,1,'Grm',15.679,0,0),(3,4,0,'Grm',15.679,0,1),(4,5,0,'Grm',15.679,0,2),(5,0,0,'Grm',15.679,0,3)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step296_Que1_Req113.html

    Time of processing all requests 1459.892, Time of current queue's turn 59.892
    Step 297Processing queue 1request 114from Node2 (2)to Node5 (5) Remain 15.655 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 15.655 Gbps, to route the capacity requirement from Node2 to Node5
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 15.655 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 20.262 19.738 1
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 24.083 15.917 1
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 22.667 17.333 1
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 37.721 2.279 2
    8 9 1 21.641 18.359 1
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917]}
  • List of VL ids with common source destination [(2, 11, 0), (2, 11, 1)]
    sdifreecapequal free capacities
    2 11 0 16.632
    2 11 1 15.917
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053]}
  • List of VL ids with common source destination [(6, 3, 0), (6, 3, 1)]
    sdifreecapequal free capacities
    6 3 0 16.172
    6 3 1 17.053
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (11, 5, 1): [17.333]}
  • List of VL ids with common source destination [(11, 5, 0), (11, 5, 1)]
    sdifreecapequal free capacities
    11 5 0 17.645
    11 5 1 17.333
  • Getting VL with max free capacity among VLs with common source destination {(10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 11, 1): [15.917], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (11, 5, 1): [17.333], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 13
    6 13 3 8 0 12
    2 3 11
    11 12 1 5
    5 12
    4 10 12
    12 3 4
    8 4 3 9
    9 3 10 11 5
    0 6 10 11 5
    7 2 5 11
    3 11 10
    1 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 13 0 15.957
    6 13 0 15.994
    6 3 0 16.172
    2 3 0 16.363
    11 12 0 16.628
    5 12 0 16.887
    4 10 0 16.902
    12 3 0 17.647
    6 8 0 17.899
    8 4 0 17.931
    9 3 0 18.188
    0 6 0 18.526
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    9 10 0 19.338
    12 4 0 19.738
    8 3 0 19.874
    9 11 0 20.197
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    0 11 0 28.835
    2 11 1 15.917
    4 12 1 16.094
    11 1 1 16.979
    11 5 1 17.333
    1 12 1 17.921
    8 9 1 18.359
    6 0 1 18.944
    3 10 1 20.256
    0 5 1 20.503
    6 12 1 22.64
  • [Finding shortest path with minimum hops] Input graph: {10: [13], 6: [13, 3, 8, 0, 12], 2: [3, 11], 11: [12, 1, 5], 5: [12], 4: [10, 12], 12: [3, 4], 8: [4, 3, 9], 9: [3, 10, 11, 5], 0: [6, 10, 11, 5], 7: [2, 5, 11], 3: [11, 10], 1: [12]}
  • Source: 2
  • Destination: 5
  • All paths [2, 11, 5] .
  • Processing path [2, 11, 5]
  • Path2links [[2, 11], [11, 5]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[2, 11], [11, 5]]
  • Subtract the utilised capacity from the Link's [2, 11] free capacity.
  • Update value is -15.655
  • Updated Virtual Link's (2,11,1) free capacity to 0.262.
  • que 1 req 114 (src 2 dst 11 num 1) type Grm capacity 15.655 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 114 VirtualLinkID: 88 (src: 2 dst: 11 ), Required Capacity: 15.655 Free Capacity (on the graph): 0.262 Free Capacity (on the corresponding array:) 0.977 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [11, 5] free capacity.
  • Update value is -15.655
  • Updated Virtual Link's (11,5,1) free capacity to 1.678.
  • que 1 req 114 (src 11 dst 5 num 1) type Grm capacity 15.655 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 114 VirtualLinkID: 91 (src: 11 dst: 5 ), Required Capacity: 15.655 Free Capacity (on the graph): 1.678 Free Capacity (on the corresponding array:) 1.99 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(2,11,1)[(1,68,24.083,'New'),(1,114,15.655,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,11,1)[39.738,0.262,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,114)[(2,11,1,'Grm',15.655,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(11,5,1)[(1,77,22.667,'New'),(1,114,15.655,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,5,1)[38.322,1.678,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,114)[(2,11,1,'Grm',15.655,0,0),(11,5,1,'Grm',15.655,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step297_Que1_Req114.html

    Time of processing all requests 1488.028, Time of current queue's turn 88.028
    Step 298Processing queue 1request 115from Node12 (12)to Node9 (9) Remain 15.523 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 15.523 Gbps, to route the capacity requirement from Node12 to Node9
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 15.523 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 24.465 15.535 1
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 22.101 17.899 1
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 20.262 19.738 1
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 37.721 2.279 2
    8 9 1 21.641 18.359 1
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
  • Getting VL with max free capacity among VLs with common source destination {(3, 12, 0): [15.528], (4, 6, 0): [15.535], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(3, 12, 0): [15.528], (4, 6, 0): [15.535], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053]}
  • List of VL ids with common source destination [(6, 3, 0), (6, 3, 1)]
    sdifreecapequal free capacities
    6 3 0 16.172
    6 3 1 17.053
  • Getting VL with max free capacity among VLs with common source destination {(3, 12, 0): [15.528], (4, 6, 0): [15.535], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (6, 8, 0): [17.899], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (12, 4, 0): [19.738], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    3 12 11 10
    4 6 10 12
    10 13
    6 13 3 8 0 12
    2 3 11
    11 12 5 1
    5 12
    12 3 4
    8 4 3 9
    9 3 10 11 5
    0 6 10 11 5
    7 2 5 11
    1 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    3 12 0 15.528
    4 6 0 15.535
    10 13 0 15.957
    6 13 0 15.994
    6 3 0 16.172
    2 3 0 16.363
    11 12 0 16.628
    2 11 0 16.632
    5 12 0 16.887
    4 10 0 16.902
    11 5 0 17.645
    12 3 0 17.647
    6 8 0 17.899
    8 4 0 17.931
    9 3 0 18.188
    0 6 0 18.526
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    9 10 0 19.338
    12 4 0 19.738
    8 3 0 19.874
    9 11 0 20.197
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    0 11 0 28.835
    4 12 1 16.094
    11 1 1 16.979
    1 12 1 17.921
    8 9 1 18.359
    6 0 1 18.944
    3 10 1 20.256
    0 5 1 20.503
    6 12 1 22.64
  • [Finding shortest path with minimum hops] Input graph: {3: [12, 11, 10], 4: [6, 10, 12], 10: [13], 6: [13, 3, 8, 0, 12], 2: [3, 11], 11: [12, 5, 1], 5: [12], 12: [3, 4], 8: [4, 3, 9], 9: [3, 10, 11, 5], 0: [6, 10, 11, 5], 7: [2, 5, 11], 1: [12]}
  • Source: 12
  • Destination: 9
  • All paths [12, 4, 6, 8, 9] .
  • Processing path [12, 4, 6, 8, 9]
  • Path2links [[12, 4], [4, 6], [6, 8], [8, 9]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[12, 4], [4, 6], [6, 8], [8, 9]]
  • Subtract the utilised capacity from the Link's [12, 4] free capacity.
  • Update value is -15.523
  • Updated Virtual Link's (12,4,0) free capacity to 4.215.
  • que 1 req 115 (src 12 dst 4 num 0) type Grm capacity 15.523 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 115 VirtualLinkID: 109 (src: 12 dst: 4 ), Required Capacity: 15.523 Free Capacity (on the graph): 4.215 Free Capacity (on the corresponding array:) 4.215 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [4, 6] free capacity.
  • Update value is -15.523
  • Updated Virtual Link's (4,6,0) free capacity to 0.012.
  • que 1 req 115 (src 4 dst 6 num 0) type Grm capacity 15.523 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 115 VirtualLinkID: 80 (src: 4 dst: 6 ), Required Capacity: 15.523 Free Capacity (on the graph): 0.012 Free Capacity (on the corresponding array:) 0.012 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [6, 8] free capacity.
  • Update value is -15.523
  • Updated Virtual Link's (6,8,0) free capacity to 2.376.
  • que 1 req 115 (src 6 dst 8 num 0) type Grm capacity 15.523 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 115 VirtualLinkID: 93 (src: 6 dst: 8 ), Required Capacity: 15.523 Free Capacity (on the graph): 2.376 Free Capacity (on the corresponding array:) 2.376 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [8, 9] free capacity.
  • Update value is -15.523
  • Updated Virtual Link's (8,9,1) free capacity to 2.836.
  • que 1 req 115 (src 8 dst 9 num 1) type Grm capacity 15.523 step of routing reqquested traffic 0 step's virtual link sequence number 3
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 115 VirtualLinkID: 64 (src: 8 dst: 9 ), Required Capacity: 15.523 Free Capacity (on the graph): 2.836 Free Capacity (on the corresponding array:) -10.033 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,4,0)[(0,108,20.262,'New'),(1,115,15.523,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,4,0)[35.785,4.215,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,115)[(12,4,0,'Grm',15.523,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(4,6,0)[(0,79,24.465,'New'),(1,115,15.523,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,6,0)[39.988,0.012,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,115)[(12,4,0,'Grm',15.523,0,0),(4,6,0,'Grm',15.523,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(6,8,0)[(0,92,22.101,'New'),(1,115,15.523,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,8,0)[37.624,2.376,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,115)[(12,4,0,'Grm',15.523,0,0),(4,6,0,'Grm',15.523,0,1),(6,8,0,'Grm',15.523,0,2)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,9,1)[(1,87,21.641,'New'),(1,115,15.523,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,9,1)[37.164,2.836,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,115)[(12,4,0,'Grm',15.523,0,0),(4,6,0,'Grm',15.523,0,1),(6,8,0,'Grm',15.523,0,2),(8,9,1,'Grm',15.523,0,3)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step298_Que1_Req115.html

    Time of processing all requests 1508.356, Time of current queue's turn 8.356
    Step 299Processing queue 1request 116from Node3 (3)to Node2 (2) Remain 15.335 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 15.335 Gbps, to route the capacity requirement from Node3 to Node2
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 15.335 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
  • Getting VL with max free capacity among VLs with common source destination {(0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053]}
  • List of VL ids with common source destination [(6, 3, 0), (6, 3, 1)]
    sdifreecapequal free capacities
    6 3 0 16.172
    6 3 1 17.053
  • Getting VL with max free capacity among VLs with common source destination {(0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    0 13 6 10 11 5
    3 12 11 10
    10 13
    6 13 3 2 0 12
    2 3 11
    11 12 5 1
    5 12
    4 10 12
    12 3
    8 4 3
    7 2 5 11
    9 10 11 5 3
    1 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    0 13 0 15.417
    3 12 0 15.528
    10 13 0 15.957
    6 13 0 15.994
    6 3 0 16.172
    2 3 0 16.363
    11 12 0 16.628
    2 11 0 16.632
    5 12 0 16.887
    4 10 0 16.902
    11 5 0 17.645
    12 3 0 17.647
    8 4 0 17.931
    0 6 0 18.526
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    9 10 0 19.338
    8 3 0 19.874
    9 11 0 20.197
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    0 11 0 28.835
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    1 12 1 17.921
    6 0 1 18.944
    3 10 1 20.256
    0 5 1 20.503
    6 12 1 22.64
  • [Finding shortest path with minimum hops] Input graph: {0: [13, 6, 10, 11, 5], 3: [12, 11, 10], 10: [13], 6: [13, 3, 2, 0, 12], 2: [3, 11], 11: [12, 5, 1], 5: [12], 4: [10, 12], 12: [3], 8: [4, 3], 7: [2, 5, 11], 9: [10, 11, 5, 3], 1: [12]}
  • Source: 3
  • Destination: 2
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 15.335
  • Adding a new virtual link from 3 to 2 .
  • A new virtual link (3, 2, 1) is created for queue 1 , request 116 , from Node3 to Node2 capacity requirement 15.335 Gbps, having free capacity 24.665 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 3 → 2 are = [9.682]
  • Capacities are [9.682]
  • que 1 req 116 (src 3 dst 2 num 1) type New capacity 15.335 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(3,2)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,2,1)[(1,116,15.335,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,2,1)[15.335,24.665,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,116)[(3,2,1,'New',15.335,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step299_Que1_Req116.html

    Time of processing all requests 1535.530, Time of current queue's turn 35.530
    Step 300Processing queue 1request 117from Node13 (13)to Node12 (12) Remain 15.236 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 15.236 Gbps, to route the capacity requirement from Node13 to Node12
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 15.236 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 15.335 24.665 1
  • Getting VL with max free capacity among VLs with common source destination {(10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (4, 0, 1): [15.264], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (4, 0, 1): [15.264], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (4, 0, 1): [15.264], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053]}
  • List of VL ids with common source destination [(6, 3, 0), (6, 3, 1)]
    sdifreecapequal free capacities
    6 3 0 16.172
    6 3 1 17.053
  • Getting VL with max free capacity among VLs with common source destination {(10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (4, 0, 1): [15.264], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 2 13
    0 13 6 10 11 5
    3 12 11 10 2
    6 13 3 2 0 12
    2 3 11
    11 12 5 1
    5 12
    4 10 0 12
    12 3
    8 4 3
    7 2 5 11
    9 10 11 5 3
    1 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 2 0 15.257
    0 13 0 15.417
    3 12 0 15.528
    10 13 0 15.957
    6 13 0 15.994
    6 3 0 16.172
    2 3 0 16.363
    11 12 0 16.628
    2 11 0 16.632
    5 12 0 16.887
    4 10 0 16.902
    11 5 0 17.645
    12 3 0 17.647
    8 4 0 17.931
    0 6 0 18.526
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    9 10 0 19.338
    8 3 0 19.874
    9 11 0 20.197
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    0 11 0 28.835
    4 0 1 15.264
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    1 12 1 17.921
    6 0 1 18.944
    3 10 1 20.256
    0 5 1 20.503
    6 12 1 22.64
    3 2 1 24.665
  • [Finding shortest path with minimum hops] Input graph: {10: [2, 13], 0: [13, 6, 10, 11, 5], 3: [12, 11, 10, 2], 6: [13, 3, 2, 0, 12], 2: [3, 11], 11: [12, 5, 1], 5: [12], 4: [10, 0, 12], 12: [3], 8: [4, 3], 7: [2, 5, 11], 9: [10, 11, 5, 3], 1: [12]}
  • Source: 13
  • Destination: 12
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 15.236
  • Adding a new virtual link from 13 to 12 .
  • A new virtual link (13, 12, 1) is created for queue 1 , request 117 , from Node13 to Node12 capacity requirement 15.236 Gbps, having free capacity 24.764 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 13 → 12 are = [9.567]
  • Capacities are [9.567]
  • que 1 req 117 (src 13 dst 12 num 1) type New capacity 15.236 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(13,12)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,12,1)[(1,117,15.236,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,12,1)[15.236,24.764,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,117)[(13,12,1,'New',15.236,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step300_Que1_Req117.html

    Time of processing all requests 1543.210, Time of current queue's turn 43.210
    Step 301Processing queue 1request 118from Node13 (13)to Node5 (5) Remain 14.754 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 14.754 Gbps, to route the capacity requirement from Node13 to Node5
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 14.754 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 22.355 17.645 1
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 24.927 15.073 1
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 15.335 24.665 1
    13 12 1 15.236 24.764 1
  • Getting VL with max free capacity among VLs with common source destination {(13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (13, 11, 1): [15.073], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (13, 11, 1): [15.073], (11, 12, 1): [15.105], (4, 0, 1): [15.264], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (13, 11, 1): [15.073], (11, 12, 1): [15.105], (4, 0, 1): [15.264], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (13, 11, 1): [15.073], (11, 12, 1): [15.105], (4, 0, 1): [15.264], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053]}
  • List of VL ids with common source destination [(6, 3, 0), (6, 3, 1)]
    sdifreecapequal free capacities
    6 3 0 16.172
    6 3 1 17.053
  • Getting VL with max free capacity among VLs with common source destination {(13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (11, 5, 0): [17.645], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (13, 11, 1): [15.073], (11, 12, 1): [15.105], (4, 0, 1): [15.264], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    13 8 6 11 12
    10 8 2 13
    0 13 6 10 11 5
    3 12 11 10 2
    6 13 3 2 0 12
    2 3 11
    5 12
    4 10 0 12
    11 5 12 1
    12 3
    8 4 3
    7 2 5 11
    9 10 11 5 3
    1 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    13 8 0 14.785
    13 6 0 15.02
    10 8 0 15.145
    10 2 0 15.257
    0 13 0 15.417
    3 12 0 15.528
    10 13 0 15.957
    6 13 0 15.994
    6 3 0 16.172
    2 3 0 16.363
    2 11 0 16.632
    5 12 0 16.887
    4 10 0 16.902
    11 5 0 17.645
    12 3 0 17.647
    8 4 0 17.931
    0 6 0 18.526
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    9 10 0 19.338
    8 3 0 19.874
    9 11 0 20.197
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    0 11 0 28.835
    13 11 1 15.073
    11 12 1 15.105
    4 0 1 15.264
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    1 12 1 17.921
    6 0 1 18.944
    3 10 1 20.256
    0 5 1 20.503
    6 12 1 22.64
    3 2 1 24.665
    13 12 1 24.764
  • [Finding shortest path with minimum hops] Input graph: {13: [8, 6, 11, 12], 10: [8, 2, 13], 0: [13, 6, 10, 11, 5], 3: [12, 11, 10, 2], 6: [13, 3, 2, 0, 12], 2: [3, 11], 5: [12], 4: [10, 0, 12], 11: [5, 12, 1], 12: [3], 8: [4, 3], 7: [2, 5, 11], 9: [10, 11, 5, 3], 1: [12]}
  • Source: 13
  • Destination: 5
  • All paths [13, 11, 5] .
  • Processing path [13, 11, 5]
  • Path2links [[13, 11], [11, 5]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[13, 11], [11, 5]]
  • Subtract the utilised capacity from the Link's [13, 11] free capacity.
  • Update value is -14.754
  • Updated Virtual Link's (13,11,1) free capacity to 0.319.
  • que 1 req 118 (src 13 dst 11 num 1) type Grm capacity 14.754 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 118 VirtualLinkID: 47 (src: 13 dst: 11 ), Required Capacity: 14.754 Free Capacity (on the graph): 0.319 Free Capacity (on the corresponding array:) -3.495 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [11, 5] free capacity.
  • Update value is -14.754
  • Updated Virtual Link's (11,5,0) free capacity to 2.891.
  • que 1 req 118 (src 11 dst 5 num 0) type Grm capacity 14.754 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 118 VirtualLinkID: 91 (src: 11 dst: 5 ), Required Capacity: 14.754 Free Capacity (on the graph): 2.891 Free Capacity (on the corresponding array:) -12.764 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(13,11,1)[(1,60,24.927,'New'),(1,118,14.754,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,11,1)[39.681,0.319,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,118)[(13,11,1,'Grm',14.754,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(11,5,0)[(0,90,22.355,'New'),(1,118,14.754,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,5,0)[37.109,2.891,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,118)[(13,11,1,'Grm',14.754,0,0),(11,5,0,'Grm',14.754,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step301_Que1_Req118.html

    Time of processing all requests 1556.123, Time of current queue's turn 56.123
    Step 302Processing queue 1request 119from Node9 (9)to Node5 (5) Remain 14.52 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 14.52 Gbps, to route the capacity requirement from Node9 to Node5
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 14.52 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 37.109 2.891 2
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 17.237 22.763 1
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 15.335 24.665 1
    13 12 1 15.236 24.764 1
  • Getting VL with max free capacity among VLs with common source destination {(12, 0, 0): [14.56], (0, 7, 0): [14.583], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (13, 1, 1): [14.521], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(12, 0, 0): [14.56], (0, 7, 0): [14.583], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (4, 0, 1): [15.264], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(12, 0, 0): [14.56], (0, 7, 0): [14.583], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (4, 0, 1): [15.264], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(12, 0, 0): [14.56], (0, 7, 0): [14.583], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (4, 0, 1): [15.264], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053]}
  • List of VL ids with common source destination [(6, 3, 0), (6, 3, 1)]
    sdifreecapequal free capacities
    6 3 0 16.172
    6 3 1 17.053
  • Getting VL with max free capacity among VLs with common source destination {(12, 0, 0): [14.56], (0, 7, 0): [14.583], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (9, 5, 0): [22.763], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (4, 0, 1): [15.264], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    12 0 3
    0 7 13 6 10 11 5
    13 8 6 1 12
    10 8 2 13
    3 12 11 10 2
    6 13 3 2 0 12
    2 3 11
    5 12
    4 10 0 12
    8 4 3
    7 2 5 11
    9 10 11 5 3
    11 12 1
    1 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    12 0 0 14.56
    0 7 0 14.583
    13 8 0 14.785
    13 6 0 15.02
    10 8 0 15.145
    10 2 0 15.257
    0 13 0 15.417
    3 12 0 15.528
    10 13 0 15.957
    6 13 0 15.994
    6 3 0 16.172
    2 3 0 16.363
    2 11 0 16.632
    5 12 0 16.887
    4 10 0 16.902
    12 3 0 17.647
    8 4 0 17.931
    0 6 0 18.526
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    9 10 0 19.338
    8 3 0 19.874
    9 11 0 20.197
    9 5 0 22.763
    3 11 0 22.986
    7 11 0 23.29
    0 11 0 28.835
    13 1 1 14.521
    11 12 1 15.105
    4 0 1 15.264
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    1 12 1 17.921
    6 0 1 18.944
    3 10 1 20.256
    0 5 1 20.503
    6 12 1 22.64
    3 2 1 24.665
    13 12 1 24.764
  • [Finding shortest path with minimum hops] Input graph: {12: [0, 3], 0: [7, 13, 6, 10, 11, 5], 13: [8, 6, 1, 12], 10: [8, 2, 13], 3: [12, 11, 10, 2], 6: [13, 3, 2, 0, 12], 2: [3, 11], 5: [12], 4: [10, 0, 12], 8: [4, 3], 7: [2, 5, 11], 9: [10, 11, 5, 3], 11: [12, 1], 1: [12]}
  • Source: 9
  • Destination: 5
  • All paths [9, 5] .
  • Processing path [9, 5]
  • Path2links [[9, 5]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[9, 5]]
  • Subtract the utilised capacity from the Link's [9, 5] free capacity.
  • Update value is -14.52
  • Updated Virtual Link's (9,5,0) free capacity to 8.243.
  • que 1 req 119 (src 9 dst 5 num 0) type Grm capacity 14.520 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 119 VirtualLinkID: 120 (src: 9 dst: 5 ), Required Capacity: 14.52 Free Capacity (on the graph): 8.243 Free Capacity (on the corresponding array:) 8.243 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(9,5,0)[(0,119,17.237,'New'),(1,119,14.520,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,5,0)[31.757,8.243,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,119)[(9,5,0,'Grm',14.520,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step302_Que1_Req119.html

    Time of processing all requests 1570.646, Time of current queue's turn 70.646
    Step 303Processing queue 1request 120from Node8 (8)to Node7 (7) Remain 14.464 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 14.464 Gbps, to route the capacity requirement from Node8 to Node7
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 14.464 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 25.417 14.583 1
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 37.109 2.891 2
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 22.069 17.931 1
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 24.736 15.264 1
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 15.335 24.665 1
    13 12 1 15.236 24.764 1
  • Getting VL with max free capacity among VLs with common source destination {(8, 5, 0): [14.519], (12, 0, 0): [14.56], (0, 7, 0): [14.583], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(8, 5, 0): [14.519], (12, 0, 0): [14.56], (0, 7, 0): [14.583], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (4, 0, 1): [15.264], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(8, 5, 0): [14.519], (12, 0, 0): [14.56], (0, 7, 0): [14.583], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (4, 0, 1): [15.264], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(8, 5, 0): [14.519], (12, 0, 0): [14.56], (0, 7, 0): [14.583], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (4, 0, 1): [15.264], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053]}
  • List of VL ids with common source destination [(6, 3, 0), (6, 3, 1)]
    sdifreecapequal free capacities
    6 3 0 16.172
    6 3 1 17.053
  • Getting VL with max free capacity among VLs with common source destination {(8, 5, 0): [14.519], (12, 0, 0): [14.56], (0, 7, 0): [14.583], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (8, 4, 0): [17.931], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (4, 0, 1): [15.264], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    8 5 4 3
    12 0 3
    0 7 13 6 10 11 5
    13 8 6 1 12
    10 8 2 13
    3 12 11 10 2
    6 13 3 2 0 12
    2 3 11 6
    5 12
    4 10 0 12
    7 2 5 11
    9 10 11 3
    11 9 12 1
    1 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    8 5 0 14.519
    12 0 0 14.56
    0 7 0 14.583
    13 8 0 14.785
    13 6 0 15.02
    10 8 0 15.145
    10 2 0 15.257
    0 13 0 15.417
    3 12 0 15.528
    10 13 0 15.957
    6 13 0 15.994
    6 3 0 16.172
    2 3 0 16.363
    2 11 0 16.632
    5 12 0 16.887
    4 10 0 16.902
    12 3 0 17.647
    8 4 0 17.931
    0 6 0 18.526
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    9 10 0 19.338
    8 3 0 19.874
    9 11 0 20.197
    3 11 0 22.986
    7 11 0 23.29
    0 11 0 28.835
    11 9 1 14.466
    2 6 1 14.471
    13 1 1 14.521
    11 12 1 15.105
    4 0 1 15.264
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    1 12 1 17.921
    6 0 1 18.944
    3 10 1 20.256
    0 5 1 20.503
    6 12 1 22.64
    3 2 1 24.665
    13 12 1 24.764
  • [Finding shortest path with minimum hops] Input graph: {8: [5, 4, 3], 12: [0, 3], 0: [7, 13, 6, 10, 11, 5], 13: [8, 6, 1, 12], 10: [8, 2, 13], 3: [12, 11, 10, 2], 6: [13, 3, 2, 0, 12], 2: [3, 11, 6], 5: [12], 4: [10, 0, 12], 7: [2, 5, 11], 9: [10, 11, 3], 11: [9, 12, 1], 1: [12]}
  • Source: 8
  • Destination: 7
  • All paths [8, 4, 0, 7] .
  • Processing path [8, 4, 0, 7]
  • Path2links [[8, 4], [4, 0], [0, 7]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[8, 4], [4, 0], [0, 7]]
  • Subtract the utilised capacity from the Link's [8, 4] free capacity.
  • Update value is -14.464
  • Updated Virtual Link's (8,4,0) free capacity to 3.467.
  • que 1 req 120 (src 8 dst 4 num 0) type Grm capacity 14.464 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 120 VirtualLinkID: 94 (src: 8 dst: 4 ), Required Capacity: 14.464 Free Capacity (on the graph): 3.467 Free Capacity (on the corresponding array:) 3.467 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [4, 0] free capacity.
  • Update value is -14.464
  • Updated Virtual Link's (4,0,1) free capacity to 0.800.
  • que 1 req 120 (src 4 dst 0 num 1) type Grm capacity 14.464 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 120 VirtualLinkID: 168 (src: 4 dst: 0 ), Required Capacity: 14.464 Free Capacity (on the graph): 0.8 Free Capacity (on the corresponding array:) -14.39 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [0, 7] free capacity.
  • Update value is -14.464
  • Updated Virtual Link's (0,7,0) free capacity to 0.119.
  • que 1 req 120 (src 0 dst 7 num 0) type Grm capacity 14.464 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 120 VirtualLinkID: 0 (src: 0 dst: 7 ), Required Capacity: 14.464 Free Capacity (on the graph): 0.119 Free Capacity (on the corresponding array:) 0.119 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,4,0)[(0,93,22.069,'New'),(1,120,14.464,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,4,0)[36.533,3.467,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,120)[(8,4,0,'Grm',14.464,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(4,0,1)[(1,64,24.736,'New'),(1,120,14.464,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,0,1)[39.200,0.800,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,120)[(8,4,0,'Grm',14.464,0,0),(4,0,1,'Grm',14.464,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(0,7,0)[(0,72,25.417,'New'),(1,120,14.464,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,7,0)[39.881,0.119,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,120)[(8,4,0,'Grm',14.464,0,0),(4,0,1,'Grm',14.464,0,1),(0,7,0,'Grm',14.464,0,2)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step303_Que1_Req120.html

    Time of processing all requests 1581.297, Time of current queue's turn 81.297
    Step 304Processing queue 1request 121from Node13 (13)to Node7 (7) Remain 14.151 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 14.151 Gbps, to route the capacity requirement from Node13 to Node7
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 14.151 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 39.881 0.119 2
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 37.109 2.891 2
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 15.335 24.665 1
    13 12 1 15.236 24.764 1
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461]}
  • List of VL ids with common source destination [(0, 6, 0), (0, 6, 1)]
    sdifreecapequal free capacities
    0 6 0 18.526
    0 6 1 14.461
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053]}
  • List of VL ids with common source destination [(6, 3, 0), (6, 3, 1)]
    sdifreecapequal free capacities
    6 3 0 16.172
    6 3 1 17.053
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    5 13 12 2
    6 4 13 3 1 2 0 12
    13 2 8 6 1 12
    8 5 3
    12 0 3
    10 8 2 13
    0 13 10 11 6 5
    3 12 11 10 2
    2 3 11 6
    4 10 12
    7 2 5 11
    9 10 11 3
    11 9 12 1
    1 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    5 13 0 14.292
    6 4 0 14.4
    13 2 0 14.463
    8 5 0 14.519
    12 0 0 14.56
    13 8 0 14.785
    13 6 0 15.02
    10 8 0 15.145
    10 2 0 15.257
    0 13 0 15.417
    3 12 0 15.528
    10 13 0 15.957
    6 13 0 15.994
    6 3 0 16.172
    2 3 0 16.363
    2 11 0 16.632
    5 12 0 16.887
    4 10 0 16.902
    12 3 0 17.647
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    9 10 0 19.338
    8 3 0 19.874
    9 11 0 20.197
    3 11 0 22.986
    7 11 0 23.29
    0 11 0 28.835
    5 2 1 14.358
    6 1 1 14.386
    0 6 1 14.461
    11 9 1 14.466
    2 6 1 14.471
    13 1 1 14.521
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    1 12 1 17.921
    6 0 1 18.944
    3 10 1 20.256
    0 5 1 20.503
    6 12 1 22.64
    3 2 1 24.665
    13 12 1 24.764
  • [Finding shortest path with minimum hops] Input graph: {5: [13, 12, 2], 6: [4, 13, 3, 1, 2, 0, 12], 13: [2, 8, 6, 1, 12], 8: [5, 3], 12: [0, 3], 10: [8, 2, 13], 0: [13, 10, 11, 6, 5], 3: [12, 11, 10, 2], 2: [3, 11, 6], 4: [10, 12], 7: [2, 5, 11], 9: [10, 11, 3], 11: [9, 12, 1], 1: [12]}
  • Source: 13
  • Destination: 7
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 14.151
  • Adding a new virtual link from 13 to 7 .
  • A new virtual link (13, 7, 1) is created for queue 1 , request 121 , from Node13 to Node7 capacity requirement 14.151 Gbps, having free capacity 25.849 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 13 → 7 are = [5.708]
  • Capacities are [5.708]
  • que 1 req 121 (src 13 dst 7 num 1) type New capacity 14.151 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(13,7)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,7,1)[(1,121,14.151,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,7,1)[14.151,25.849,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,121)[(13,7,1,'New',14.151,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step304_Que1_Req121.html

    Time of processing all requests 1606.967, Time of current queue's turn 6.967
    Step 305Processing queue 1request 122from Node6 (6)to Node11 (11) Remain 14.138 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 14.138 Gbps, to route the capacity requirement from Node6 to Node11
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 14.138 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 39.881 0.119 2
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 23.828 16.172 1
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 37.109 2.891 2
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 17.014 22.986 1
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 15.335 24.665 1
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461]}
  • List of VL ids with common source destination [(0, 6, 0), (0, 6, 1)]
    sdifreecapequal free capacities
    0 6 0 18.526
    0 6 1 14.461
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053]}
  • List of VL ids with common source destination [(6, 3, 0), (6, 3, 1)]
    sdifreecapequal free capacities
    6 3 0 16.172
    6 3 1 17.053
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (6, 3, 0): [16.172], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (3, 11, 0): [22.986], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    5 13 12 2
    6 4 13 3 1 2 0 12
    13 2 8 6 1 12 7
    8 5 3
    12 0 3
    10 8 2 13
    0 13 10 11 6 5
    3 12 11 10 2
    2 3 11 6
    4 10 12
    7 2 5 11
    9 10 11 3
    11 9 12 1
    1 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    5 13 0 14.292
    6 4 0 14.4
    13 2 0 14.463
    8 5 0 14.519
    12 0 0 14.56
    13 8 0 14.785
    13 6 0 15.02
    10 8 0 15.145
    10 2 0 15.257
    0 13 0 15.417
    3 12 0 15.528
    10 13 0 15.957
    6 13 0 15.994
    6 3 0 16.172
    2 3 0 16.363
    2 11 0 16.632
    5 12 0 16.887
    4 10 0 16.902
    12 3 0 17.647
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    9 10 0 19.338
    8 3 0 19.874
    9 11 0 20.197
    3 11 0 22.986
    7 11 0 23.29
    0 11 0 28.835
    5 2 1 14.358
    6 1 1 14.386
    0 6 1 14.461
    11 9 1 14.466
    2 6 1 14.471
    13 1 1 14.521
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    1 12 1 17.921
    6 0 1 18.944
    3 10 1 20.256
    0 5 1 20.503
    6 12 1 22.64
    3 2 1 24.665
    13 12 1 24.764
    13 7 1 25.849
  • [Finding shortest path with minimum hops] Input graph: {5: [13, 12, 2], 6: [4, 13, 3, 1, 2, 0, 12], 13: [2, 8, 6, 1, 12, 7], 8: [5, 3], 12: [0, 3], 10: [8, 2, 13], 0: [13, 10, 11, 6, 5], 3: [12, 11, 10, 2], 2: [3, 11, 6], 4: [10, 12], 7: [2, 5, 11], 9: [10, 11, 3], 11: [9, 12, 1], 1: [12]}
  • Source: 6
  • Destination: 11
  • All paths [6, 3, 11] .
  • Processing path [6, 3, 11]
  • Path2links [[6, 3], [3, 11]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[6, 3], [3, 11]]
  • Subtract the utilised capacity from the Link's [6, 3] free capacity.
  • Update value is -14.138
  • Updated Virtual Link's (6,3,0) free capacity to 2.034.
  • que 1 req 122 (src 6 dst 3 num 0) type Grm capacity 14.138 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 122 VirtualLinkID: 83 (src: 6 dst: 3 ), Required Capacity: 14.138 Free Capacity (on the graph): 2.034 Free Capacity (on the corresponding array:) 2.034 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [3, 11] free capacity.
  • Update value is -14.138
  • Updated Virtual Link's (3,11,0) free capacity to 8.848.
  • que 1 req 122 (src 3 dst 11 num 0) type Grm capacity 14.138 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 122 VirtualLinkID: 121 (src: 3 dst: 11 ), Required Capacity: 14.138 Free Capacity (on the graph): 8.848 Free Capacity (on the corresponding array:) 8.848 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(6,3,0)[(0,82,23.828,'New'),(1,122,14.138,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,3,0)[37.966,2.034,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,122)[(6,3,0,'Grm',14.138,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,11,0)[(0,120,17.014,'New'),(1,122,14.138,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,11,0)[31.152,8.848,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,122)[(6,3,0,'Grm',14.138,0,0),(3,11,0,'Grm',14.138,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step305_Que1_Req122.html

    Time of processing all requests 1624.213, Time of current queue's turn 24.213
    Step 306Processing queue 1request 123from Node1 (1)to Node13 (13) Remain 14.049 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 14.049 Gbps, to route the capacity requirement from Node1 to Node13
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 14.049 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 25.44 14.56 1
    0 7 0 39.881 0.119 2
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 24.583 15.417 1
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 37.109 2.891 2
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 22.079 17.921 1
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 15.335 24.665 1
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461]}
  • List of VL ids with common source destination [(0, 6, 0), (0, 6, 1)]
    sdifreecapequal free capacities
    0 6 0 18.526
    0 6 1 14.461
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (12, 0, 0): [14.56], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (0, 13, 0): [15.417], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    5 13 12 2
    6 4 13 1 2 3 0 12
    13 2 8 6 1 12 7
    8 5 3
    12 0 3
    10 8 2 13
    0 13 10 11 6 5
    3 12 10 2
    2 3 11 6
    4 10 12
    7 2 5 11
    9 10 11 3
    11 9 12 1
    1 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    5 13 0 14.292
    6 4 0 14.4
    13 2 0 14.463
    8 5 0 14.519
    12 0 0 14.56
    13 8 0 14.785
    13 6 0 15.02
    10 8 0 15.145
    10 2 0 15.257
    0 13 0 15.417
    3 12 0 15.528
    10 13 0 15.957
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    5 12 0 16.887
    4 10 0 16.902
    12 3 0 17.647
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    9 10 0 19.338
    8 3 0 19.874
    9 11 0 20.197
    7 11 0 23.29
    0 11 0 28.835
    5 2 1 14.358
    6 1 1 14.386
    0 6 1 14.461
    11 9 1 14.466
    2 6 1 14.471
    13 1 1 14.521
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    6 3 1 17.053
    1 12 1 17.921
    6 0 1 18.944
    3 10 1 20.256
    0 5 1 20.503
    6 12 1 22.64
    3 2 1 24.665
    13 12 1 24.764
    13 7 1 25.849
  • [Finding shortest path with minimum hops] Input graph: {5: [13, 12, 2], 6: [4, 13, 1, 2, 3, 0, 12], 13: [2, 8, 6, 1, 12, 7], 8: [5, 3], 12: [0, 3], 10: [8, 2, 13], 0: [13, 10, 11, 6, 5], 3: [12, 10, 2], 2: [3, 11, 6], 4: [10, 12], 7: [2, 5, 11], 9: [10, 11, 3], 11: [9, 12, 1], 1: [12]}
  • Source: 1
  • Destination: 13
  • All paths [1, 12, 0, 13] .
  • Processing path [1, 12, 0, 13]
  • Path2links [[1, 12], [12, 0], [0, 13]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[1, 12], [12, 0], [0, 13]]
  • Subtract the utilised capacity from the Link's [1, 12] free capacity.
  • Update value is -14.049
  • Updated Virtual Link's (1,12,1) free capacity to 3.872.
  • que 1 req 123 (src 1 dst 12 num 1) type Grm capacity 14.049 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 123 VirtualLinkID: 157 (src: 1 dst: 12 ), Required Capacity: 14.049 Free Capacity (on the graph): 3.872 Free Capacity (on the corresponding array:) -8.551 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [12, 0] free capacity.
  • Update value is -14.049
  • Updated Virtual Link's (12,0,0) free capacity to 0.511.
  • que 1 req 123 (src 12 dst 0 num 0) type Grm capacity 14.049 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 123 VirtualLinkID: 0 (src: 12 dst: 0 ), Required Capacity: 14.049 Free Capacity (on the graph): 0.511 Free Capacity (on the corresponding array:) 0.511 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [0, 13] free capacity.
  • Update value is -14.049
  • Updated Virtual Link's (0,13,0) free capacity to 1.368.
  • que 1 req 123 (src 0 dst 13 num 0) type Grm capacity 14.049 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 123 VirtualLinkID: 78 (src: 0 dst: 13 ), Required Capacity: 14.049 Free Capacity (on the graph): 1.368 Free Capacity (on the corresponding array:) 1.368 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,12,1)[(1,85,22.079,'New'),(1,123,14.049,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,12,1)[36.128,3.872,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,123)[(1,12,1,'Grm',14.049,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,0,0)[(0,71,25.440,'New'),(1,123,14.049,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,0,0)[39.489,0.511,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,123)[(1,12,1,'Grm',14.049,0,0),(12,0,0,'Grm',14.049,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(0,13,0)[(0,77,24.583,'New'),(1,123,14.049,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,13,0)[38.632,1.368,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,123)[(1,12,1,'Grm',14.049,0,0),(12,0,0,'Grm',14.049,0,1),(0,13,0,'Grm',14.049,0,2)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step306_Que1_Req123.html

    Time of processing all requests 1646.143, Time of current queue's turn 46.143
    Step 307Processing queue 1request 124from Node1 (1)to Node7 (7) Remain 13.927 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 13.927 Gbps, to route the capacity requirement from Node1 to Node7
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 13.927 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 37.109 2.891 2
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 15.335 24.665 1
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
  • Getting VL with max free capacity among VLs with common source destination {(2, 6, 0): [13.969], (5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 12, 1): [13.978]}
  • List of VL ids with common source destination [(5, 12, 0), (5, 12, 1)]
    sdifreecapequal free capacities
    5 12 0 16.887
    5 12 1 13.978
  • Getting VL with max free capacity among VLs with common source destination {(2, 6, 0): [13.969], (5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461]}
  • List of VL ids with common source destination [(0, 6, 0), (0, 6, 1)]
    sdifreecapequal free capacities
    0 6 0 18.526
    0 6 1 14.461
  • Getting VL with max free capacity among VLs with common source destination {(2, 6, 0): [13.969], (5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471]}
  • List of VL ids with common source destination [(2, 6, 0), (2, 6, 1)]
    sdifreecapequal free capacities
    2 6 0 13.969
    2 6 1 14.471
  • Getting VL with max free capacity among VLs with common source destination {(2, 6, 0): [13.969], (5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(2, 6, 0): [13.969], (5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(2, 6, 0): [13.969], (5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(2, 6, 0): [13.969], (5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 6 3 11
    5 13 12 2
    6 4 13 1 2 3 0 12
    13 2 8 6 1 12 7
    8 5 3
    10 8 2 13
    3 12 10 2
    4 10 12
    12 3
    7 2 5 11
    0 10 11 6 5
    9 10 11 7 3
    11 9 12 1
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 6 0 13.969
    5 13 0 14.292
    6 4 0 14.4
    13 2 0 14.463
    8 5 0 14.519
    13 8 0 14.785
    13 6 0 15.02
    10 8 0 15.145
    10 2 0 15.257
    3 12 0 15.528
    10 13 0 15.957
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    4 10 0 16.902
    12 3 0 17.647
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    9 10 0 19.338
    8 3 0 19.874
    9 11 0 20.197
    7 11 0 23.29
    0 11 0 28.835
    5 12 1 13.978
    9 7 1 13.998
    5 2 1 14.358
    6 1 1 14.386
    0 6 1 14.461
    11 9 1 14.466
    13 1 1 14.521
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    6 3 1 17.053
    6 0 1 18.944
    3 10 1 20.256
    0 5 1 20.503
    6 12 1 22.64
    3 2 1 24.665
    13 12 1 24.764
    13 7 1 25.849
  • [Finding shortest path with minimum hops] Input graph: {2: [6, 3, 11], 5: [13, 12, 2], 6: [4, 13, 1, 2, 3, 0, 12], 13: [2, 8, 6, 1, 12, 7], 8: [5, 3], 10: [8, 2, 13], 3: [12, 10, 2], 4: [10, 12], 12: [3], 7: [2, 5, 11], 0: [10, 11, 6, 5], 9: [10, 11, 7, 3], 11: [9, 12, 1]}
  • Source: 1
  • Destination: 7
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 13.927
  • Adding a new virtual link from 1 to 7 .
  • A new virtual link (1, 7, 1) is created for queue 1 , request 124 , from Node1 to Node7 capacity requirement 13.927 Gbps, having free capacity 26.073 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 1 → 7 are = [11.911]
  • Capacities are [11.911]
  • que 1 req 124 (src 1 dst 7 num 1) type New capacity 13.927 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(1,7)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(1,7,1)[(1,124,13.927,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,7,1)[13.927,26.073,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,124)[(1,7,1,'New',13.927,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step307_Que1_Req124.html

    Time of processing all requests 1664.568, Time of current queue's turn 64.568
    Step 308Processing queue 1request 125from Node1 (1)to Node8 (8) Remain 13.921 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 13.921 Gbps, to route the capacity requirement from Node1 to Node8
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 13.921 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 25.708 14.292 1
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 25.215 14.785 1
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 37.109 2.891 2
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 21.239 18.761 1
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 15.335 24.665 1
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 13.927 26.073 1
  • Getting VL with max free capacity among VLs with common source destination {(2, 6, 0): [13.969], (5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 12, 1): [13.978]}
  • List of VL ids with common source destination [(5, 12, 0), (5, 12, 1)]
    sdifreecapequal free capacities
    5 12 0 16.887
    5 12 1 13.978
  • Getting VL with max free capacity among VLs with common source destination {(2, 6, 0): [13.969], (5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461]}
  • List of VL ids with common source destination [(0, 6, 0), (0, 6, 1)]
    sdifreecapequal free capacities
    0 6 0 18.526
    0 6 1 14.461
  • Getting VL with max free capacity among VLs with common source destination {(2, 6, 0): [13.969], (5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471]}
  • List of VL ids with common source destination [(2, 6, 0), (2, 6, 1)]
    sdifreecapequal free capacities
    2 6 0 13.969
    2 6 1 14.471
  • Getting VL with max free capacity among VLs with common source destination {(2, 6, 0): [13.969], (5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(2, 6, 0): [13.969], (5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(2, 6, 0): [13.969], (5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(2, 6, 0): [13.969], (5, 13, 0): [14.292], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 8, 0): [14.785], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (7, 5, 0): [18.761], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 6 3 11
    5 13 12 2
    6 4 13 1 2 3 0 12
    13 2 8 6 1 12 7
    8 5 3
    10 8 2 13
    3 12 10 2
    4 10 12
    12 3
    7 2 5 11
    0 10 11 6 5
    9 10 11 7 3
    11 9 12 1
    1 7
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 6 0 13.969
    5 13 0 14.292
    6 4 0 14.4
    13 2 0 14.463
    8 5 0 14.519
    13 8 0 14.785
    13 6 0 15.02
    10 8 0 15.145
    10 2 0 15.257
    3 12 0 15.528
    10 13 0 15.957
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    4 10 0 16.902
    12 3 0 17.647
    7 2 0 18.575
    7 5 0 18.761
    0 10 0 18.874
    9 10 0 19.338
    8 3 0 19.874
    9 11 0 20.197
    7 11 0 23.29
    0 11 0 28.835
    5 12 1 13.978
    9 7 1 13.998
    5 2 1 14.358
    6 1 1 14.386
    0 6 1 14.461
    11 9 1 14.466
    13 1 1 14.521
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    6 3 1 17.053
    6 0 1 18.944
    3 10 1 20.256
    0 5 1 20.503
    6 12 1 22.64
    3 2 1 24.665
    13 12 1 24.764
    13 7 1 25.849
    1 7 1 26.073
  • [Finding shortest path with minimum hops] Input graph: {2: [6, 3, 11], 5: [13, 12, 2], 6: [4, 13, 1, 2, 3, 0, 12], 13: [2, 8, 6, 1, 12, 7], 8: [5, 3], 10: [8, 2, 13], 3: [12, 10, 2], 4: [10, 12], 12: [3], 7: [2, 5, 11], 0: [10, 11, 6, 5], 9: [10, 11, 7, 3], 11: [9, 12, 1], 1: [7]}
  • Source: 1
  • Destination: 8
  • All paths [1, 7, 5, 13, 8] .
  • Processing path [1, 7, 5, 13, 8]
  • Path2links [[1, 7], [7, 5], [5, 13], [13, 8]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[1, 7], [7, 5], [5, 13], [13, 8]]
  • Subtract the utilised capacity from the Link's [1, 7] free capacity.
  • Update value is -13.921
  • Updated Virtual Link's (1,7,1) free capacity to 12.152.
  • que 1 req 125 (src 1 dst 7 num 1) type Grm capacity 13.921 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 125 VirtualLinkID: 78 (src: 1 dst: 7 ), Required Capacity: 13.921 Free Capacity (on the graph): 12.152 Free Capacity (on the corresponding array:) -2.01 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [7, 5] free capacity.
  • Update value is -13.921
  • Updated Virtual Link's (7,5,0) free capacity to 4.840.
  • que 1 req 125 (src 7 dst 5 num 0) type Grm capacity 13.921 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 125 VirtualLinkID: 100 (src: 7 dst: 5 ), Required Capacity: 13.921 Free Capacity (on the graph): 4.84 Free Capacity (on the corresponding array:) 4.84 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [5, 13] free capacity.
  • Update value is -13.921
  • Updated Virtual Link's (5,13,0) free capacity to 0.371.
  • que 1 req 125 (src 5 dst 13 num 0) type Grm capacity 13.921 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 125 VirtualLinkID: 0 (src: 5 dst: 13 ), Required Capacity: 13.921 Free Capacity (on the graph): 0.371 Free Capacity (on the corresponding array:) 0.371 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [13, 8] free capacity.
  • Update value is -13.921
  • Updated Virtual Link's (13,8,0) free capacity to 0.864.
  • que 1 req 125 (src 13 dst 8 num 0) type Grm capacity 13.921 step of routing reqquested traffic 0 step's virtual link sequence number 3
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 125 VirtualLinkID: 2 (src: 13 dst: 8 ), Required Capacity: 13.921 Free Capacity (on the graph): 0.864 Free Capacity (on the corresponding array:) 0.864 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,7,1)[(1,124,13.927,'New'),(1,125,13.921,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,7,1)[27.848,12.152,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,125)[(1,7,1,'Grm',13.921,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(7,5,0)[(0,99,21.239,'New'),(1,125,13.921,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,5,0)[35.160,4.840,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,125)[(1,7,1,'Grm',13.921,0,0),(7,5,0,'Grm',13.921,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(5,13,0)[(0,67,25.708,'New'),(1,125,13.921,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,13,0)[39.629,0.371,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,125)[(1,7,1,'Grm',13.921,0,0),(7,5,0,'Grm',13.921,0,1),(5,13,0,'Grm',13.921,0,2)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(13,8,0)[(0,73,25.215,'New'),(1,125,13.921,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,8,0)[39.136,0.864,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,125)[(1,7,1,'Grm',13.921,0,0),(7,5,0,'Grm',13.921,0,1),(5,13,0,'Grm',13.921,0,2),(13,8,0,'Grm',13.921,0,3)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step308_Que1_Req125.html

    Time of processing all requests 1675.394, Time of current queue's turn 75.394
    Step 309Processing queue 1request 126from Node3 (3)to Node6 (6) Remain 13.729 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 13.729 Gbps, to route the capacity requirement from Node3 to Node6
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 13.729 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 26.031 13.969 1
    5 13 0 39.629 0.371 2
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 37.109 2.891 2
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 15.335 24.665 1
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (2, 6, 0): [13.969], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978]}
  • List of VL ids with common source destination [(5, 12, 0), (5, 12, 1)]
    sdifreecapequal free capacities
    5 12 0 16.887
    5 12 1 13.978
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (2, 6, 0): [13.969], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461]}
  • List of VL ids with common source destination [(0, 6, 0), (0, 6, 1)]
    sdifreecapequal free capacities
    0 6 0 18.526
    0 6 1 14.461
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (2, 6, 0): [13.969], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471]}
  • List of VL ids with common source destination [(2, 6, 0), (2, 6, 1)]
    sdifreecapequal free capacities
    2 6 0 13.969
    2 6 1 14.471
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (2, 6, 0): [13.969], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (2, 6, 0): [13.969], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (2, 6, 0): [13.969], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (2, 6, 0): [13.969], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    13 9 2 6 1 12 7
    2 6 3 11
    6 4 13 1 2 3 0 12
    8 5 3
    10 8 2 13
    3 12 10 2
    4 10 12
    12 3
    7 2 11
    0 10 11 6 5
    9 10 11 8 12 7 3
    5 4 12 2
    11 9 12 1
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    13 9 0 13.833
    2 6 0 13.969
    6 4 0 14.4
    13 2 0 14.463
    8 5 0 14.519
    13 6 0 15.02
    10 8 0 15.145
    10 2 0 15.257
    3 12 0 15.528
    10 13 0 15.957
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    4 10 0 16.902
    12 3 0 17.647
    7 2 0 18.575
    0 10 0 18.874
    9 10 0 19.338
    8 3 0 19.874
    9 11 0 20.197
    7 11 0 23.29
    0 11 0 28.835
    9 8 1 13.731
    5 4 1 13.745
    9 12 1 13.869
    5 12 1 13.978
    9 7 1 13.998
    5 2 1 14.358
    6 1 1 14.386
    0 6 1 14.461
    11 9 1 14.466
    13 1 1 14.521
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    6 3 1 17.053
    6 0 1 18.944
    3 10 1 20.256
    0 5 1 20.503
    6 12 1 22.64
    3 2 1 24.665
    13 12 1 24.764
    13 7 1 25.849
  • [Finding shortest path with minimum hops] Input graph: {13: [9, 2, 6, 1, 12, 7], 2: [6, 3, 11], 6: [4, 13, 1, 2, 3, 0, 12], 8: [5, 3], 10: [8, 2, 13], 3: [12, 10, 2], 4: [10, 12], 12: [3], 7: [2, 11], 0: [10, 11, 6, 5], 9: [10, 11, 8, 12, 7, 3], 5: [4, 12, 2], 11: [9, 12, 1]}
  • Source: 3
  • Destination: 6
  • All paths [3, 2, 6] .
  • Processing path [3, 2, 6]
  • Path2links [[3, 2], [2, 6]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[3, 2], [2, 6]]
  • Subtract the utilised capacity from the Link's [3, 2] free capacity.
  • Update value is -13.729
  • Updated Virtual Link's (3,2,1) free capacity to 10.936.
  • que 1 req 126 (src 3 dst 2 num 1) type Grm capacity 13.729 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 126 VirtualLinkID: 153 (src: 3 dst: 2 ), Required Capacity: 13.729 Free Capacity (on the graph): 10.936 Free Capacity (on the corresponding array:) -4.047 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [2, 6] free capacity.
  • Update value is -13.729
  • Updated Virtual Link's (2,6,0) free capacity to 0.240.
  • que 1 req 126 (src 2 dst 6 num 0) type Grm capacity 13.729 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 126 VirtualLinkID: 45 (src: 2 dst: 6 ), Required Capacity: 13.729 Free Capacity (on the graph): 0.24 Free Capacity (on the corresponding array:) 0.24 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,2,1)[(1,116,15.335,'New'),(1,126,13.729,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,2,1)[29.064,10.936,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,126)[(3,2,1,'Grm',13.729,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(2,6,0)[(0,66,26.031,'New'),(1,126,13.729,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,6,0)[39.760,0.240,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,126)[(3,2,1,'Grm',13.729,0,0),(2,6,0,'Grm',13.729,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step309_Que1_Req126.html

    Time of processing all requests 1704.587, Time of current queue's turn 4.587
    Step 310Processing queue 1request 127from Node8 (8)to Node0 (0) Remain 13.689 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 13.689 Gbps, to route the capacity requirement from Node8 to Node0
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 13.689 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 25.481 14.519 1
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 37.109 2.891 2
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 25.642 14.358 1
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 25.529 14.471 1
    13 1 1 25.479 14.521 1
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 21.056 18.944 1
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 29.064 10.936 2
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978]}
  • List of VL ids with common source destination [(5, 12, 0), (5, 12, 1)]
    sdifreecapequal free capacities
    5 12 0 16.887
    5 12 1 13.978
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461]}
  • List of VL ids with common source destination [(0, 6, 0), (0, 6, 1)]
    sdifreecapequal free capacities
    0 6 0 18.526
    0 6 1 14.461
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (8, 5, 0): [14.519], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (5, 2, 1): [14.358], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (2, 6, 1): [14.471], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    13 9 2 6 1 12 7
    6 4 13 1 2 3 0 12
    8 5 3
    10 8 2 13
    3 12 10
    2 3 11 6
    4 10 12
    12 3
    7 2 11
    0 10 11 6 5
    9 10 11 8 12 7 3
    5 4 12 2
    11 9 12 1
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    13 9 0 13.833
    6 4 0 14.4
    13 2 0 14.463
    8 5 0 14.519
    13 6 0 15.02
    10 8 0 15.145
    10 2 0 15.257
    3 12 0 15.528
    10 13 0 15.957
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    4 10 0 16.902
    12 3 0 17.647
    7 2 0 18.575
    0 10 0 18.874
    9 10 0 19.338
    8 3 0 19.874
    9 11 0 20.197
    7 11 0 23.29
    0 11 0 28.835
    9 8 1 13.731
    5 4 1 13.745
    9 12 1 13.869
    5 12 1 13.978
    9 7 1 13.998
    5 2 1 14.358
    6 1 1 14.386
    0 6 1 14.461
    11 9 1 14.466
    2 6 1 14.471
    13 1 1 14.521
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    6 3 1 17.053
    6 0 1 18.944
    3 10 1 20.256
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
  • [Finding shortest path with minimum hops] Input graph: {13: [9, 2, 6, 1, 12, 7], 6: [4, 13, 1, 2, 3, 0, 12], 8: [5, 3], 10: [8, 2, 13], 3: [12, 10], 2: [3, 11, 6], 4: [10, 12], 12: [3], 7: [2, 11], 0: [10, 11, 6, 5], 9: [10, 11, 8, 12, 7, 3], 5: [4, 12, 2], 11: [9, 12, 1]}
  • Source: 8
  • Destination: 0
  • All paths [8, 5, 2, 6, 0] .
  • Processing path [8, 5, 2, 6, 0]
  • Path2links [[8, 5], [5, 2], [2, 6], [6, 0]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[8, 5], [5, 2], [2, 6], [6, 0]]
  • Subtract the utilised capacity from the Link's [8, 5] free capacity.
  • Update value is -13.689
  • Updated Virtual Link's (8,5,0) free capacity to 0.830.
  • que 1 req 127 (src 8 dst 5 num 0) type Grm capacity 13.689 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 127 VirtualLinkID: 0 (src: 8 dst: 5 ), Required Capacity: 13.689 Free Capacity (on the graph): 0.83 Free Capacity (on the corresponding array:) 0.83 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [5, 2] free capacity.
  • Update value is -13.689
  • Updated Virtual Link's (5,2,1) free capacity to 0.669.
  • que 1 req 127 (src 5 dst 2 num 1) type Grm capacity 13.689 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 127 VirtualLinkID: 41 (src: 5 dst: 2 ), Required Capacity: 13.689 Free Capacity (on the graph): 0.669 Free Capacity (on the corresponding array:) -4.883 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [2, 6] free capacity.
  • Update value is -13.689
  • Updated Virtual Link's (2,6,1) free capacity to 0.782.
  • que 1 req 127 (src 2 dst 6 num 1) type Grm capacity 13.689 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 127 VirtualLinkID: 45 (src: 2 dst: 6 ), Required Capacity: 13.689 Free Capacity (on the graph): 0.782 Free Capacity (on the corresponding array:) -13.449 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [6, 0] free capacity.
  • Update value is -13.689
  • Updated Virtual Link's (6,0,1) free capacity to 5.255.
  • que 1 req 127 (src 6 dst 0 num 1) type Grm capacity 13.689 step of routing reqquested traffic 0 step's virtual link sequence number 3
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 127 VirtualLinkID: 146 (src: 6 dst: 0 ), Required Capacity: 13.689 Free Capacity (on the graph): 5.255 Free Capacity (on the corresponding array:) -13.119 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,5,0)[(0,70,25.481,'New'),(1,127,13.689,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,5,0)[39.170,0.830,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,127)[(8,5,0,'Grm',13.689,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(5,2,1)[(1,54,25.642,'New'),(1,127,13.689,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,2,1)[39.331,0.669,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,127)[(8,5,0,'Grm',13.689,0,0),(5,2,1,'Grm',13.689,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(2,6,1)[(1,58,25.529,'New'),(1,127,13.689,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,6,1)[39.218,0.782,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,127)[(8,5,0,'Grm',13.689,0,0),(5,2,1,'Grm',13.689,0,1),(2,6,1,'Grm',13.689,0,2)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(6,0,1)[(1,90,21.056,'New'),(1,127,13.689,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,0,1)[34.745,5.255,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,127)[(8,5,0,'Grm',13.689,0,0),(5,2,1,'Grm',13.689,0,1),(2,6,1,'Grm',13.689,0,2),(6,0,1,'Grm',13.689,0,3)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step310_Que1_Req127.html

    Time of processing all requests 1720.123, Time of current queue's turn 20.123
    Step 311Processing queue 1request 128from Node3 (3)to Node4 (4) Remain 13.607 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 13.607 Gbps, to route the capacity requirement from Node3 to Node4
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 13.607 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 25.6 14.4 1
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 24.98 15.02 1
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 24.043 15.957 1
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 37.109 2.891 2
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 39.331 0.669 2
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 39.218 0.782 2
    13 1 1 25.479 14.521 1
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 19.744 20.256 1
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 29.064 10.936 2
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978]}
  • List of VL ids with common source destination [(5, 12, 0), (5, 12, 1)]
    sdifreecapequal free capacities
    5 12 0 16.887
    5 12 1 13.978
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461]}
  • List of VL ids with common source destination [(0, 6, 0), (0, 6, 1)]
    sdifreecapequal free capacities
    0 6 0 18.526
    0 6 1 14.461
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (6, 4, 0): [14.4], (13, 2, 0): [14.463], (13, 6, 0): [15.02], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (10, 13, 0): [15.957], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    13 9 2 6 1 12 7
    6 4 13 1 2 3 12
    10 8 2 13
    3 12 10
    2 3 11
    4 10 12
    12 3
    7 2 11
    0 10 11 6 5
    9 10 11 8 12 7 3
    8 3
    1 8
    5 4 12
    11 9 12 1
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    13 9 0 13.833
    6 4 0 14.4
    13 2 0 14.463
    13 6 0 15.02
    10 8 0 15.145
    10 2 0 15.257
    3 12 0 15.528
    10 13 0 15.957
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    4 10 0 16.902
    12 3 0 17.647
    7 2 0 18.575
    0 10 0 18.874
    9 10 0 19.338
    8 3 0 19.874
    9 11 0 20.197
    7 11 0 23.29
    0 11 0 28.835
    1 8 0 13.622
    9 8 1 13.731
    5 4 1 13.745
    9 12 1 13.869
    5 12 1 13.978
    9 7 1 13.998
    6 1 1 14.386
    0 6 1 14.461
    11 9 1 14.466
    13 1 1 14.521
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    6 3 1 17.053
    3 10 1 20.256
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
  • [Finding shortest path with minimum hops] Input graph: {13: [9, 2, 6, 1, 12, 7], 6: [4, 13, 1, 2, 3, 12], 10: [8, 2, 13], 3: [12, 10], 2: [3, 11], 4: [10, 12], 12: [3], 7: [2, 11], 0: [10, 11, 6, 5], 9: [10, 11, 8, 12, 7, 3], 8: [3], 1: [8], 5: [4, 12], 11: [9, 12, 1]}
  • Source: 3
  • Destination: 4
  • All paths [3, 10, 13, 6, 4] .
  • Processing path [3, 10, 13, 6, 4]
  • Path2links [[3, 10], [10, 13], [13, 6], [6, 4]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[3, 10], [10, 13], [13, 6], [6, 4]]
  • Subtract the utilised capacity from the Link's [3, 10] free capacity.
  • Update value is -13.607
  • Updated Virtual Link's (3,10,1) free capacity to 6.649.
  • que 1 req 128 (src 3 dst 10 num 1) type Grm capacity 13.607 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 128 VirtualLinkID: 69 (src: 3 dst: 10 ), Required Capacity: 13.607 Free Capacity (on the graph): 6.649 Free Capacity (on the corresponding array:) -6.137 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [10, 13] free capacity.
  • Update value is -13.607
  • Updated Virtual Link's (10,13,0) free capacity to 2.350.
  • que 1 req 128 (src 10 dst 13 num 0) type Grm capacity 13.607 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 128 VirtualLinkID: 81 (src: 10 dst: 13 ), Required Capacity: 13.607 Free Capacity (on the graph): 2.35 Free Capacity (on the corresponding array:) 2.35 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [13, 6] free capacity.
  • Update value is -13.607
  • Updated Virtual Link's (13,6,0) free capacity to 1.413.
  • que 1 req 128 (src 13 dst 6 num 0) type Grm capacity 13.607 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 128 VirtualLinkID: 0 (src: 13 dst: 6 ), Required Capacity: 13.607 Free Capacity (on the graph): 1.413 Free Capacity (on the corresponding array:) 1.413 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [6, 4] free capacity.
  • Update value is -13.607
  • Updated Virtual Link's (6,4,0) free capacity to 0.793.
  • que 1 req 128 (src 6 dst 4 num 0) type Grm capacity 13.607 step of routing reqquested traffic 0 step's virtual link sequence number 3
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 128 VirtualLinkID: 0 (src: 6 dst: 4 ), Required Capacity: 13.607 Free Capacity (on the graph): 0.793 Free Capacity (on the corresponding array:) 0.793 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,10,1)[(1,96,19.744,'New'),(1,128,13.607,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,10,1)[33.351,6.649,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,128)[(3,10,1,'Grm',13.607,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(10,13,0)[(0,80,24.043,'New'),(1,128,13.607,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,13,0)[37.650,2.350,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,128)[(3,10,1,'Grm',13.607,0,0),(10,13,0,'Grm',13.607,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(13,6,0)[(0,74,24.980,'New'),(1,128,13.607,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,6,0)[38.587,1.413,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,128)[(3,10,1,'Grm',13.607,0,0),(10,13,0,'Grm',13.607,0,1),(13,6,0,'Grm',13.607,0,2)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(6,4,0)[(0,68,25.600,'New'),(1,128,13.607,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,4,0)[39.207,0.793,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,128)[(3,10,1,'Grm',13.607,0,0),(10,13,0,'Grm',13.607,0,1),(13,6,0,'Grm',13.607,0,2),(6,4,0,'Grm',13.607,0,3)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step311_Que1_Req128.html

    Time of processing all requests 1742.329, Time of current queue's turn 42.329
    Step 312Processing queue 1request 129from Node5 (5)to Node8 (8) Remain 13.557 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 13.557 Gbps, to route the capacity requirement from Node5 to Node8
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 13.557 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 24.855 15.145 1
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 23.098 16.902 1
    11 5 0 37.109 2.891 2
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 26.255 13.745 1
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 39.331 0.669 2
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 39.218 0.782 2
    13 1 1 25.479 14.521 1
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 29.064 10.936 2
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978]}
  • List of VL ids with common source destination [(5, 12, 0), (5, 12, 1)]
    sdifreecapequal free capacities
    5 12 0 16.887
    5 12 1 13.978
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461]}
  • List of VL ids with common source destination [(0, 6, 0), (0, 6, 1)]
    sdifreecapequal free capacities
    0 6 0 18.526
    0 6 1 14.461
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 8, 0): [15.145], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (4, 10, 0): [16.902], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (5, 4, 1): [13.745], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    13 9 2 1 12 7
    10 8 2
    3 12
    6 13 1 2 3 12
    2 3 11
    4 10 12
    12 3
    7 2 11
    0 10 11 6 5
    9 10 11 8 12 7 3
    8 3
    1 8
    5 4 12
    11 9 12 1
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    13 9 0 13.833
    13 2 0 14.463
    10 8 0 15.145
    10 2 0 15.257
    3 12 0 15.528
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    4 10 0 16.902
    12 3 0 17.647
    7 2 0 18.575
    0 10 0 18.874
    9 10 0 19.338
    8 3 0 19.874
    9 11 0 20.197
    7 11 0 23.29
    0 11 0 28.835
    1 8 0 13.622
    9 8 1 13.731
    5 4 1 13.745
    9 12 1 13.869
    5 12 1 13.978
    9 7 1 13.998
    6 1 1 14.386
    0 6 1 14.461
    11 9 1 14.466
    13 1 1 14.521
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
  • [Finding shortest path with minimum hops] Input graph: {13: [9, 2, 1, 12, 7], 10: [8, 2], 3: [12], 6: [13, 1, 2, 3, 12], 2: [3, 11], 4: [10, 12], 12: [3], 7: [2, 11], 0: [10, 11, 6, 5], 9: [10, 11, 8, 12, 7, 3], 8: [3], 1: [8], 5: [4, 12], 11: [9, 12, 1]}
  • Source: 5
  • Destination: 8
  • All paths [5, 4, 10, 8] .
  • Processing path [5, 4, 10, 8]
  • Path2links [[5, 4], [4, 10], [10, 8]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[5, 4], [4, 10], [10, 8]]
  • Subtract the utilised capacity from the Link's [5, 4] free capacity.
  • Update value is -13.557
  • Updated Virtual Link's (5,4,1) free capacity to 0.188.
  • que 1 req 129 (src 5 dst 4 num 1) type Grm capacity 13.557 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 129 VirtualLinkID: 149 (src: 5 dst: 4 ), Required Capacity: 13.557 Free Capacity (on the graph): 0.188 Free Capacity (on the corresponding array:) -12.35 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [4, 10] free capacity.
  • Update value is -13.557
  • Updated Virtual Link's (4,10,0) free capacity to 3.345.
  • que 1 req 129 (src 4 dst 10 num 0) type Grm capacity 13.557 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 129 VirtualLinkID: 90 (src: 4 dst: 10 ), Required Capacity: 13.557 Free Capacity (on the graph): 3.345 Free Capacity (on the corresponding array:) 3.345 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [10, 8] free capacity.
  • Update value is -13.557
  • Updated Virtual Link's (10,8,0) free capacity to 1.588.
  • que 1 req 129 (src 10 dst 8 num 0) type Grm capacity 13.557 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 129 VirtualLinkID: 9 (src: 10 dst: 8 ), Required Capacity: 13.557 Free Capacity (on the graph): 1.588 Free Capacity (on the corresponding array:) 1.588 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(5,4,1)[(1,49,26.255,'New'),(1,129,13.557,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,4,1)[39.812,0.188,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,129)[(5,4,1,'Grm',13.557,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(4,10,0)[(0,89,23.098,'New'),(1,129,13.557,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,10,0)[36.655,3.345,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,129)[(5,4,1,'Grm',13.557,0,0),(4,10,0,'Grm',13.557,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(10,8,0)[(0,75,24.855,'New'),(1,129,13.557,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,8,0)[38.412,1.588,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,129)[(5,4,1,'Grm',13.557,0,0),(4,10,0,'Grm',13.557,0,1),(10,8,0,'Grm',13.557,0,2)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step312_Que1_Req129.html

    Time of processing all requests 1765.222, Time of current queue's turn 65.222
    Step 313Processing queue 1request 130from Node8 (8)to Node5 (5) Remain 13.044 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 13.044 Gbps, to route the capacity requirement from Node8 to Node5
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 13.044 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 39.331 0.669 2
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 39.218 0.782 2
    13 1 1 25.479 14.521 1
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 29.064 10.936 2
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
  • Getting VL with max free capacity among VLs with common source destination {(2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978]}
  • List of VL ids with common source destination [(5, 12, 0), (5, 12, 1)]
    sdifreecapequal free capacities
    5 12 0 16.887
    5 12 1 13.978
  • Getting VL with max free capacity among VLs with common source destination {(2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461]}
  • List of VL ids with common source destination [(0, 6, 0), (0, 6, 1)]
    sdifreecapequal free capacities
    0 6 0 18.526
    0 6 1 14.461
  • Getting VL with max free capacity among VLs with common source destination {(2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 12 3 11
    4 9 12
    13 9 2 1 12 7
    10 2
    3 12
    6 13 1 2 3 12
    12 3
    7 2 11
    0 10 11 6 5
    9 10 11 8 12 7 3
    8 3
    1 8
    5 12
    11 9 12 1
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 12 0 13.044
    4 9 0 13.252
    13 9 0 13.833
    13 2 0 14.463
    10 2 0 15.257
    3 12 0 15.528
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    12 3 0 17.647
    7 2 0 18.575
    0 10 0 18.874
    9 10 0 19.338
    8 3 0 19.874
    9 11 0 20.197
    7 11 0 23.29
    0 11 0 28.835
    1 8 0 13.622
    9 8 1 13.731
    9 12 1 13.869
    5 12 1 13.978
    9 7 1 13.998
    6 1 1 14.386
    0 6 1 14.461
    11 9 1 14.466
    13 1 1 14.521
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
  • [Finding shortest path with minimum hops] Input graph: {2: [12, 3, 11], 4: [9, 12], 13: [9, 2, 1, 12, 7], 10: [2], 3: [12], 6: [13, 1, 2, 3, 12], 12: [3], 7: [2, 11], 0: [10, 11, 6, 5], 9: [10, 11, 8, 12, 7, 3], 8: [3], 1: [8], 5: [12], 11: [9, 12, 1]}
  • Source: 8
  • Destination: 5
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 13.044
  • Adding a new virtual link from 8 to 5 .
  • A new virtual link (8, 5, 1) is created for queue 1 , request 130 , from Node8 to Node5 capacity requirement 13.044 Gbps, having free capacity 26.956 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 8 → 5 are = [0.83]
  • Capacities are [0.83]
  • que 1 req 130 (src 8 dst 5 num 1) type New capacity 13.044 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(8,5)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(8,5,1)[(1,130,13.044,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,5,1)[13.044,26.956,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,130)[(8,5,1,'New',13.044,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step313_Que1_Req130.html

    Time of processing all requests 1783.709, Time of current queue's turn 83.709
    Step 314Processing queue 1request 131from Node3 (3)to Node9 (9) Remain 12.885 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 12.885 Gbps, to route the capacity requirement from Node3 to Node9
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 12.885 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 39.331 0.669 2
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 39.218 0.782 2
    13 1 1 25.479 14.521 1
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 29.064 10.936 2
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 13.044 26.956 1
  • Getting VL with max free capacity among VLs with common source destination {(10, 0, 0): [12.964], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(10, 0, 0): [12.964], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978]}
  • List of VL ids with common source destination [(5, 12, 0), (5, 12, 1)]
    sdifreecapequal free capacities
    5 12 0 16.887
    5 12 1 13.978
  • Getting VL with max free capacity among VLs with common source destination {(10, 0, 0): [12.964], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461]}
  • List of VL ids with common source destination [(0, 6, 0), (0, 6, 1)]
    sdifreecapequal free capacities
    0 6 0 18.526
    0 6 1 14.461
  • Getting VL with max free capacity among VLs with common source destination {(10, 0, 0): [12.964], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(10, 0, 0): [12.964], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(10, 0, 0): [12.964], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(10, 0, 0): [12.964], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 0 2 9
    2 12 3 11
    4 9 12
    13 9 2 1 12 7
    3 12
    6 13 1 2 3 12
    12 3
    7 2 11
    0 10 11 6 5
    8 3 5
    9 11 10 8 12 7 3
    1 8
    5 12
    11 9 12 1
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 0 0 12.964
    2 12 0 13.044
    4 9 0 13.252
    13 9 0 13.833
    13 2 0 14.463
    10 2 0 15.257
    3 12 0 15.528
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    12 3 0 17.647
    7 2 0 18.575
    0 10 0 18.874
    8 3 0 19.874
    9 11 0 20.197
    7 11 0 23.29
    0 11 0 28.835
    1 8 0 13.622
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    5 12 1 13.978
    9 7 1 13.998
    6 1 1 14.386
    0 6 1 14.461
    11 9 1 14.466
    13 1 1 14.521
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 26.956
  • [Finding shortest path with minimum hops] Input graph: {10: [0, 2, 9], 2: [12, 3, 11], 4: [9, 12], 13: [9, 2, 1, 12, 7], 3: [12], 6: [13, 1, 2, 3, 12], 12: [3], 7: [2, 11], 0: [10, 11, 6, 5], 8: [3, 5], 9: [11, 10, 8, 12, 7, 3], 1: [8], 5: [12], 11: [9, 12, 1]}
  • Source: 3
  • Destination: 9
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 12.885
  • Adding a new virtual link from 3 to 9 .
  • A new virtual link (3, 9, 1) is created for queue 1 , request 131 , from Node3 to Node9 capacity requirement 12.885 Gbps, having free capacity 27.115 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 3 → 9 are = [7.035]
  • Capacities are [7.035]
  • que 1 req 131 (src 3 dst 9 num 1) type New capacity 12.885 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(3,9)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(3,9,1)[(1,131,12.885,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,9,1)[12.885,27.115,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,131)[(3,9,1,'New',12.885,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step314_Que1_Req131.html

    Time of processing all requests 1790.755, Time of current queue's turn 90.755
    Step 315Processing queue 1request 132from Node10 (10)to Node6 (6) Remain 12.843 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 12.843 Gbps, to route the capacity requirement from Node10 to Node6
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 12.843 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 27.036 12.964 1
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 39.331 0.669 2
    6 1 1 25.614 14.386 1
    0 6 1 25.539 14.461 1
    11 9 1 25.534 14.466 1
    2 6 1 39.218 0.782 2
    13 1 1 25.479 14.521 1
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 29.064 10.936 2
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 13.044 26.956 1
    3 9 1 12.885 27.115 1
  • Getting VL with max free capacity among VLs with common source destination {(7, 6, 0): [12.866], (10, 0, 0): [12.964], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(7, 6, 0): [12.866], (10, 0, 0): [12.964], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978]}
  • List of VL ids with common source destination [(5, 12, 0), (5, 12, 1)]
    sdifreecapequal free capacities
    5 12 0 16.887
    5 12 1 13.978
  • Getting VL with max free capacity among VLs with common source destination {(7, 6, 0): [12.866], (10, 0, 0): [12.964], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461]}
  • List of VL ids with common source destination [(0, 6, 0), (0, 6, 1)]
    sdifreecapequal free capacities
    0 6 0 18.526
    0 6 1 14.461
  • Getting VL with max free capacity among VLs with common source destination {(7, 6, 0): [12.866], (10, 0, 0): [12.964], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(7, 6, 0): [12.866], (10, 0, 0): [12.964], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(7, 6, 0): [12.866], (10, 0, 0): [12.964], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(7, 6, 0): [12.866], (10, 0, 0): [12.964], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (0, 6, 1): [14.461], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    7 6 2 11
    10 0 2 9
    2 12 3 11
    4 9 12
    13 9 2 1 12 7
    3 12 9
    6 13 1 2 3 12
    12 3
    0 10 11 6 5
    8 3 5
    9 11 10 8 12 7 3
    1 8
    5 12
    11 9 12 1
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    7 6 0 12.866
    10 0 0 12.964
    2 12 0 13.044
    4 9 0 13.252
    13 9 0 13.833
    13 2 0 14.463
    10 2 0 15.257
    3 12 0 15.528
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    12 3 0 17.647
    7 2 0 18.575
    0 10 0 18.874
    8 3 0 19.874
    9 11 0 20.197
    7 11 0 23.29
    0 11 0 28.835
    1 8 0 13.622
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    5 12 1 13.978
    9 7 1 13.998
    6 1 1 14.386
    0 6 1 14.461
    11 9 1 14.466
    13 1 1 14.521
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 26.956
    3 9 1 27.115
  • [Finding shortest path with minimum hops] Input graph: {7: [6, 2, 11], 10: [0, 2, 9], 2: [12, 3, 11], 4: [9, 12], 13: [9, 2, 1, 12, 7], 3: [12, 9], 6: [13, 1, 2, 3, 12], 12: [3], 0: [10, 11, 6, 5], 8: [3, 5], 9: [11, 10, 8, 12, 7, 3], 1: [8], 5: [12], 11: [9, 12, 1]}
  • Source: 10
  • Destination: 6
  • All paths [10, 0, 6] .
  • Processing path [10, 0, 6]
  • Path2links [[10, 0], [0, 6]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[10, 0], [0, 6]]
  • Subtract the utilised capacity from the Link's [10, 0] free capacity.
  • Update value is -12.843
  • Updated Virtual Link's (10,0,0) free capacity to 0.121.
  • que 1 req 132 (src 10 dst 0 num 0) type Grm capacity 12.843 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 132 VirtualLinkID: 0 (src: 10 dst: 0 ), Required Capacity: 12.843 Free Capacity (on the graph): 0.121 Free Capacity (on the corresponding array:) 0.121 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [0, 6] free capacity.
  • Update value is -12.843
  • Updated Virtual Link's (0,6,1) free capacity to 1.618.
  • que 1 req 132 (src 0 dst 6 num 1) type Grm capacity 12.843 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 132 VirtualLinkID: 97 (src: 0 dst: 6 ), Required Capacity: 12.843 Free Capacity (on the graph): 1.618 Free Capacity (on the corresponding array:) 5.683 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(10,0,0)[(0,62,27.036,'New'),(1,132,12.843,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,0,0)[39.879,0.121,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,132)[(10,0,0,'Grm',12.843,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(0,6,1)[(1,56,25.539,'New'),(1,132,12.843,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,6,1)[38.382,1.618,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,132)[(10,0,0,'Grm',12.843,0,0),(0,6,1,'Grm',12.843,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step315_Que1_Req132.html

    Time of processing all requests 1799.376, Time of current queue's turn 99.376
    Step 316Processing queue 1request 133from Node5 (5)to Node1 (1) Remain 12.723 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 12.723 Gbps, to route the capacity requirement from Node5 to Node1
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 12.723 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 22.353 17.647 1
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 19.803 20.197 1
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 26.022 13.978 1
    9 7 1 26.002 13.998 1
    5 2 1 39.331 0.669 2
    6 1 1 25.614 14.386 1
    0 6 1 38.382 1.618 2
    11 9 1 25.534 14.466 1
    2 6 1 39.218 0.782 2
    13 1 1 25.479 14.521 1
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 23.021 16.979 1
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 29.064 10.936 2
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 13.044 26.956 1
    3 9 1 12.885 27.115 1
  • Getting VL with max free capacity among VLs with common source destination {(4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978]}
  • List of VL ids with common source destination [(5, 12, 0), (5, 12, 1)]
    sdifreecapequal free capacities
    5 12 0 16.887
    5 12 1 13.978
  • Getting VL with max free capacity among VLs with common source destination {(4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (12, 3, 0): [17.647], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (9, 11, 0): [20.197], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (1, 8, 0): [13.622], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (5, 12, 1): [13.978], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (11, 1, 1): [16.979], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 2 9 12
    7 6 2 11
    2 12 3 11
    13 9 2 1 12 7
    10 2 9
    3 12 9
    6 13 1 2 3 12
    12 3
    0 6 10 11 5
    8 3 5
    9 11 10 8 12 7 3
    1 8
    5 12
    11 9 12 1
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 2 0 12.755
    7 6 0 12.866
    2 12 0 13.044
    4 9 0 13.252
    13 9 0 13.833
    13 2 0 14.463
    10 2 0 15.257
    3 12 0 15.528
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    12 3 0 17.647
    0 6 0 18.526
    7 2 0 18.575
    0 10 0 18.874
    8 3 0 19.874
    9 11 0 20.197
    7 11 0 23.29
    0 11 0 28.835
    1 8 0 13.622
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    5 12 1 13.978
    9 7 1 13.998
    6 1 1 14.386
    11 9 1 14.466
    13 1 1 14.521
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    11 1 1 16.979
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 26.956
    3 9 1 27.115
  • [Finding shortest path with minimum hops] Input graph: {4: [2, 9, 12], 7: [6, 2, 11], 2: [12, 3, 11], 13: [9, 2, 1, 12, 7], 10: [2, 9], 3: [12, 9], 6: [13, 1, 2, 3, 12], 12: [3], 0: [6, 10, 11, 5], 8: [3, 5], 9: [11, 10, 8, 12, 7, 3], 1: [8], 5: [12], 11: [9, 12, 1]}
  • Source: 5
  • Destination: 1
  • All paths [5, 12, 3, 9, 11, 1] .
  • Processing path [5, 12, 3, 9, 11, 1]
  • Path2links [[5, 12], [12, 3], [3, 9], [9, 11], [11, 1]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[5, 12], [12, 3], [3, 9], [9, 11], [11, 1]]
  • Subtract the utilised capacity from the Link's [5, 12] free capacity.
  • Update value is -12.723
  • Updated Virtual Link's (5,12,1) free capacity to 1.255.
  • que 1 req 133 (src 5 dst 12 num 1) type Grm capacity 12.723 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 133 VirtualLinkID: 89 (src: 5 dst: 12 ), Required Capacity: 12.723 Free Capacity (on the graph): 1.255 Free Capacity (on the corresponding array:) 4.164 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [12, 3] free capacity.
  • Update value is -12.723
  • Updated Virtual Link's (12,3,0) free capacity to 4.924.
  • que 1 req 133 (src 12 dst 3 num 0) type Grm capacity 12.723 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 133 VirtualLinkID: 92 (src: 12 dst: 3 ), Required Capacity: 12.723 Free Capacity (on the graph): 4.924 Free Capacity (on the corresponding array:) 4.924 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [3, 9] free capacity.
  • Update value is -12.723
  • Updated Virtual Link's (3,9,1) free capacity to 14.392.
  • que 1 req 133 (src 3 dst 9 num 1) type Grm capacity 12.723 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 133 VirtualLinkID: 80 (src: 3 dst: 9 ), Required Capacity: 12.723 Free Capacity (on the graph): 14.392 Free Capacity (on the corresponding array:) -5.688 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [9, 11] free capacity.
  • Update value is -12.723
  • Updated Virtual Link's (9,11,0) free capacity to 7.474.
  • que 1 req 133 (src 9 dst 11 num 0) type Grm capacity 12.723 step of routing reqquested traffic 0 step's virtual link sequence number 3
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 133 VirtualLinkID: 112 (src: 9 dst: 11 ), Required Capacity: 12.723 Free Capacity (on the graph): 7.474 Free Capacity (on the corresponding array:) 7.474 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [11, 1] free capacity.
  • Update value is -12.723
  • Updated Virtual Link's (11,1,1) free capacity to 4.256.
  • que 1 req 133 (src 11 dst 1 num 1) type Grm capacity 12.723 step of routing reqquested traffic 0 step's virtual link sequence number 4
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 133 VirtualLinkID: 56 (src: 11 dst: 1 ), Required Capacity: 12.723 Free Capacity (on the graph): 4.256 Free Capacity (on the corresponding array:) -2.952 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(5,12,1)[(1,51,26.022,'New'),(1,133,12.723,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,12,1)[38.745,1.255,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,133)[(5,12,1,'Grm',12.723,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,3,0)[(0,91,22.353,'New'),(1,133,12.723,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,3,0)[35.076,4.924,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,133)[(5,12,1,'Grm',12.723,0,0),(12,3,0,'Grm',12.723,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,9,1)[(1,131,12.885,'New'),(1,133,12.723,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,9,1)[25.608,14.392,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,133)[(5,12,1,'Grm',12.723,0,0),(12,3,0,'Grm',12.723,0,1),(3,9,1,'Grm',12.723,0,2)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(9,11,0)[(0,111,19.803,'New'),(1,133,12.723,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,11,0)[32.526,7.474,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,133)[(5,12,1,'Grm',12.723,0,0),(12,3,0,'Grm',12.723,0,1),(3,9,1,'Grm',12.723,0,2),(9,11,0,'Grm',12.723,0,3)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(11,1,1)[(1,74,23.021,'New'),(1,133,12.723,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,1,1)[35.744,4.256,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,133)[(5,12,1,'Grm',12.723,0,0),(12,3,0,'Grm',12.723,0,1),(3,9,1,'Grm',12.723,0,2),(9,11,0,'Grm',12.723,0,3),(11,1,1,'Grm',12.723,0,4)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step316_Que1_Req133.html

    Time of processing all requests 1820.739, Time of current queue's turn 20.739
    Step 317Processing queue 1request 134from Node3 (3)to Node1 (1) Remain 11.723 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 11.723 Gbps, to route the capacity requirement from Node3 to Node1
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 11.723 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 28.126 11.874 1
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 24.472 15.528 1
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 26.002 13.998 1
    5 2 1 39.331 0.669 2
    6 1 1 25.614 14.386 1
    0 6 1 38.382 1.618 2
    11 9 1 25.534 14.466 1
    2 6 1 39.218 0.782 2
    13 1 1 25.479 14.521 1
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 29.064 10.936 2
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 13.044 26.956 1
    3 9 1 25.608 14.392 2
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (12, 13, 0): [11.874], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (12, 13, 0): [11.874], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (12, 13, 0): [11.874], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (9, 7, 1): [13.998]}
  • List of VL ids with common source destination [(9, 7, 0), (9, 7, 1)]
    sdifreecapequal free capacities
    9 7 0 12.078
    9 7 1 13.998
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (12, 13, 0): [11.874], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (12, 13, 0): [11.874], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (12, 13, 0): [11.874], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (12, 13, 0): [11.874], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (12, 13, 0): [11.874], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (3, 12, 0): [15.528], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (13, 1, 1): [14.521], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 7 2 9 12
    12 13 10 8
    1 7 0 8
    9 7 10 8 12 3
    8 12 3 5
    13 5 9 2 1 12 7
    11 6 9 12
    5 3 12 9
    7 6 2 11
    2 12 3 11 10 7 9
    10 2 1 9
    3 12 9
    6 13 1 2 3 12
    0 6 10 11 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 7 0 11.827
    12 13 0 11.874
    1 7 0 11.911
    9 7 0 12.078
    1 0 0 12.114
    8 12 0 12.188
    13 5 0 12.412
    11 6 0 12.51
    5 3 0 12.62
    4 2 0 12.755
    7 6 0 12.866
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    10 2 0 15.257
    3 12 0 15.528
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    5 12 0 16.887
    0 6 0 18.526
    7 2 0 18.575
    0 10 0 18.874
    8 3 0 19.874
    7 11 0 23.29
    0 11 0 28.835
    2 10 0 12.133
    1 8 0 13.622
    12 10 1 12.128
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    12 8 1 12.505
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    6 1 1 14.386
    11 9 1 14.466
    13 1 1 14.521
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 26.956
    3 9 1 14.392
  • [Finding shortest path with minimum hops] Input graph: {4: [7, 2, 9, 12], 12: [13, 10, 8], 1: [7, 0, 8], 9: [7, 10, 8, 12, 3], 8: [12, 3, 5], 13: [5, 9, 2, 1, 12, 7], 11: [6, 9, 12], 5: [3, 12, 9], 7: [6, 2, 11], 2: [12, 3, 11, 10, 7, 9], 10: [2, 1, 9], 3: [12, 9], 6: [13, 1, 2, 3, 12], 0: [6, 10, 11, 5]}
  • Source: 3
  • Destination: 1
  • All paths [3, 12, 13, 1] .
  • Processing path [3, 12, 13, 1]
  • Path2links [[3, 12], [12, 13], [13, 1]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[3, 12], [12, 13], [13, 1]]
  • Subtract the utilised capacity from the Link's [3, 12] free capacity.
  • Update value is -11.723
  • Updated Virtual Link's (3,12,0) free capacity to 3.805.
  • que 1 req 134 (src 3 dst 12 num 0) type Grm capacity 11.723 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 134 VirtualLinkID: 0 (src: 3 dst: 12 ), Required Capacity: 11.723 Free Capacity (on the graph): 3.805 Free Capacity (on the corresponding array:) 3.805 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [12, 13] free capacity.
  • Update value is -11.723
  • Updated Virtual Link's (12,13,0) free capacity to 0.151.
  • que 1 req 134 (src 12 dst 13 num 0) type Grm capacity 11.723 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 134 VirtualLinkID: 0 (src: 12 dst: 13 ), Required Capacity: 11.723 Free Capacity (on the graph): 0.151 Free Capacity (on the corresponding array:) 0.151 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [13, 1] free capacity.
  • Update value is -11.723
  • Updated Virtual Link's (13,1,1) free capacity to 2.798.
  • que 1 req 134 (src 13 dst 1 num 1) type Grm capacity 11.723 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 134 VirtualLinkID: 46 (src: 13 dst: 1 ), Required Capacity: 11.723 Free Capacity (on the graph): 2.798 Free Capacity (on the corresponding array:) -5.857 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,12,0)[(0,78,24.472,'New'),(1,134,11.723,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,12,0)[36.195,3.805,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,134)[(3,12,0,'Grm',11.723,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,13,0)[(0,52,28.126,'New'),(1,134,11.723,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,13,0)[39.849,0.151,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,134)[(3,12,0,'Grm',11.723,0,0),(12,13,0,'Grm',11.723,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(13,1,1)[(1,59,25.479,'New'),(1,134,11.723,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,1,1)[37.202,2.798,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,134)[(3,12,0,'Grm',11.723,0,0),(12,13,0,'Grm',11.723,0,1),(13,1,1,'Grm',11.723,0,2)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step317_Que1_Req134.html

    Time of processing all requests 1846.337, Time of current queue's turn 46.337
    Step 318Processing queue 1request 135from Node0 (0)to Node10 (10) Remain 11.722 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 11.722 Gbps, to route the capacity requirement from Node0 to Node10
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 11.722 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 21.126 18.874 1
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 26.002 13.998 1
    5 2 1 39.331 0.669 2
    6 1 1 25.614 14.386 1
    0 6 1 38.382 1.618 2
    11 9 1 25.534 14.466 1
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 29.064 10.936 2
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 13.044 26.956 1
    3 9 1 25.608 14.392 2
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (9, 7, 1): [13.998]}
  • List of VL ids with common source destination [(9, 7, 0), (9, 7, 1)]
    sdifreecapequal free capacities
    9 7 0 12.078
    9 7 1 13.998
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [18.874], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 7 2 9 12
    1 7 0 8
    9 7 10 8 12 3
    8 12 3 5
    13 5 9 2 12 7
    11 6 9 12
    5 3 12 9
    7 6 2 11
    2 12 3 11 10 7 9
    10 2 1 9
    6 13 1 2 3 12
    0 6 10 11 5
    12 10 8
    3 9
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 7 0 11.827
    1 7 0 11.911
    9 7 0 12.078
    1 0 0 12.114
    8 12 0 12.188
    13 5 0 12.412
    11 6 0 12.51
    5 3 0 12.62
    4 2 0 12.755
    7 6 0 12.866
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    10 2 0 15.257
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    5 12 0 16.887
    0 6 0 18.526
    7 2 0 18.575
    0 10 0 18.874
    8 3 0 19.874
    7 11 0 23.29
    0 11 0 28.835
    2 10 0 12.133
    1 8 0 13.622
    12 10 1 12.128
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    12 8 1 12.505
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    6 1 1 14.386
    11 9 1 14.466
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 26.956
    3 9 1 14.392
  • [Finding shortest path with minimum hops] Input graph: {4: [7, 2, 9, 12], 1: [7, 0, 8], 9: [7, 10, 8, 12, 3], 8: [12, 3, 5], 13: [5, 9, 2, 12, 7], 11: [6, 9, 12], 5: [3, 12, 9], 7: [6, 2, 11], 2: [12, 3, 11, 10, 7, 9], 10: [2, 1, 9], 6: [13, 1, 2, 3, 12], 0: [6, 10, 11, 5], 12: [10, 8], 3: [9]}
  • Source: 0
  • Destination: 10
  • All paths [0, 10] .
  • Processing path [0, 10]
  • Path2links [[0, 10]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[0, 10]]
  • Subtract the utilised capacity from the Link's [0, 10] free capacity.
  • Update value is -11.722
  • Updated Virtual Link's (0,10,0) free capacity to 7.152.
  • que 1 req 135 (src 0 dst 10 num 0) type Grm capacity 11.722 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 135 VirtualLinkID: 101 (src: 0 dst: 10 ), Required Capacity: 11.722 Free Capacity (on the graph): 7.152 Free Capacity (on the corresponding array:) 7.152 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(0,10,0)[(0,100,21.126,'New'),(1,135,11.722,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,10,0)[32.848,7.152,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,135)[(0,10,0,'Grm',11.722,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step318_Que1_Req135.html

    Time of processing all requests 1865.585, Time of current queue's turn 65.585
    Step 319Processing queue 1request 136from Node12 (12)to Node5 (5) Remain 11.709 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 11.709 Gbps, to route the capacity requirement from Node12 to Node5
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 11.709 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 27.495 12.505 1
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 26.002 13.998 1
    5 2 1 39.331 0.669 2
    6 1 1 25.614 14.386 1
    0 6 1 38.382 1.618 2
    11 9 1 25.534 14.466 1
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 29.064 10.936 2
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 13.044 26.956 1
    3 9 1 25.608 14.392 2
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (9, 7, 1): [13.998]}
  • List of VL ids with common source destination [(9, 7, 0), (9, 7, 1)]
    sdifreecapequal free capacities
    9 7 0 12.078
    9 7 1 13.998
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (12, 8, 1): [12.505], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 7 2 9 12
    1 7 0 8
    9 7 10 8 12 3
    8 12 3 5
    13 5 9 2 12 7
    11 6 9 12
    5 3 12 9
    7 6 2 11
    2 12 3 11 10 7 9
    10 2 1 9
    6 13 1 2 3 12
    0 6 11 5
    12 10 8
    3 9
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 7 0 11.827
    1 7 0 11.911
    9 7 0 12.078
    1 0 0 12.114
    8 12 0 12.188
    13 5 0 12.412
    11 6 0 12.51
    5 3 0 12.62
    4 2 0 12.755
    7 6 0 12.866
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    10 2 0 15.257
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    5 12 0 16.887
    0 6 0 18.526
    7 2 0 18.575
    8 3 0 19.874
    7 11 0 23.29
    0 11 0 28.835
    2 10 0 12.133
    1 8 0 13.622
    12 10 1 12.128
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    12 8 1 12.505
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    6 1 1 14.386
    11 9 1 14.466
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 26.956
    3 9 1 14.392
  • [Finding shortest path with minimum hops] Input graph: {4: [7, 2, 9, 12], 1: [7, 0, 8], 9: [7, 10, 8, 12, 3], 8: [12, 3, 5], 13: [5, 9, 2, 12, 7], 11: [6, 9, 12], 5: [3, 12, 9], 7: [6, 2, 11], 2: [12, 3, 11, 10, 7, 9], 10: [2, 1, 9], 6: [13, 1, 2, 3, 12], 0: [6, 11, 5], 12: [10, 8], 3: [9]}
  • Source: 12
  • Destination: 5
  • All paths [12, 8, 5] .
  • Processing path [12, 8, 5]
  • Path2links [[12, 8], [8, 5]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[12, 8], [8, 5]]
  • Subtract the utilised capacity from the Link's [12, 8] free capacity.
  • Update value is -11.709
  • Updated Virtual Link's (12,8,1) free capacity to 0.796.
  • que 1 req 136 (src 12 dst 8 num 1) type Grm capacity 11.709 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 136 VirtualLinkID: 31 (src: 12 dst: 8 ), Required Capacity: 11.709 Free Capacity (on the graph): 0.796 Free Capacity (on the corresponding array:) -3.833 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [8, 5] free capacity.
  • Update value is -11.709
  • Updated Virtual Link's (8,5,1) free capacity to 15.247.
  • que 1 req 136 (src 8 dst 5 num 1) type Grm capacity 11.709 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 136 VirtualLinkID: 79 (src: 8 dst: 5 ), Required Capacity: 11.709 Free Capacity (on the graph): 15.247 Free Capacity (on the corresponding array:) -10.879 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,8,1)[(1,42,27.495,'New'),(1,136,11.709,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,8,1)[39.204,0.796,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,136)[(12,8,1,'Grm',11.709,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,5,1)[(1,130,13.044,'New'),(1,136,11.709,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,5,1)[24.753,15.247,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,136)[(12,8,1,'Grm',11.709,0,0),(8,5,1,'Grm',11.709,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step319_Que1_Req136.html

    Time of processing all requests 1876.531, Time of current queue's turn 76.531
    Step 320Processing queue 1request 137from Node1 (1)to Node0 (0) Remain 11.542 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 11.542 Gbps, to route the capacity requirement from Node1 to Node0
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 11.542 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 27.886 12.114 1
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 26.002 13.998 1
    5 2 1 39.331 0.669 2
    6 1 1 25.614 14.386 1
    0 6 1 38.382 1.618 2
    11 9 1 25.534 14.466 1
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 29.064 10.936 2
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 25.608 14.392 2
  • Getting VL with max free capacity among VLs with common source destination {(8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (9, 7, 1): [13.998]}
  • List of VL ids with common source destination [(9, 7, 0), (9, 7, 1)]
    sdifreecapequal free capacities
    9 7 0 12.078
    9 7 1 13.998
  • Getting VL with max free capacity among VLs with common source destination {(8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (1, 0, 0): [12.114], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    8 2 12 3 5
    4 7 2 9 12
    1 7 0 8
    9 7 10 8 12 3
    13 5 9 2 10 12 7
    11 6 9 12
    5 3 12 9
    7 6 2 11
    2 12 3 11 10 7 9
    10 2 1 9
    6 13 1 2 3 12
    0 6 11 5
    12 10
    3 9
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    8 2 0 11.701
    4 7 0 11.827
    1 7 0 11.911
    9 7 0 12.078
    1 0 0 12.114
    8 12 0 12.188
    13 5 0 12.412
    11 6 0 12.51
    5 3 0 12.62
    4 2 0 12.755
    7 6 0 12.866
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    10 2 0 15.257
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    5 12 0 16.887
    0 6 0 18.526
    7 2 0 18.575
    8 3 0 19.874
    7 11 0 23.29
    0 11 0 28.835
    2 10 0 12.133
    1 8 0 13.622
    13 10 1 11.562
    12 10 1 12.128
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    6 1 1 14.386
    11 9 1 14.466
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 15.247
    3 9 1 14.392
  • [Finding shortest path with minimum hops] Input graph: {8: [2, 12, 3, 5], 4: [7, 2, 9, 12], 1: [7, 0, 8], 9: [7, 10, 8, 12, 3], 13: [5, 9, 2, 10, 12, 7], 11: [6, 9, 12], 5: [3, 12, 9], 7: [6, 2, 11], 2: [12, 3, 11, 10, 7, 9], 10: [2, 1, 9], 6: [13, 1, 2, 3, 12], 0: [6, 11, 5], 12: [10], 3: [9]}
  • Source: 1
  • Destination: 0
  • All paths [1, 0] .
  • Processing path [1, 0]
  • Path2links [[1, 0]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[1, 0]]
  • Subtract the utilised capacity from the Link's [1, 0] free capacity.
  • Update value is -11.542
  • Updated Virtual Link's (1,0,0) free capacity to 0.572.
  • que 1 req 137 (src 1 dst 0 num 0) type Grm capacity 11.542 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 137 VirtualLinkID: 0 (src: 1 dst: 0 ), Required Capacity: 11.542 Free Capacity (on the graph): 0.572 Free Capacity (on the corresponding array:) 0.572 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,0,0)[(0,55,27.886,'New'),(1,137,11.542,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,0,0)[39.428,0.572,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,137)[(1,0,0,'Grm',11.542,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step320_Que1_Req137.html

    Time of processing all requests 1891.767, Time of current queue's turn 91.767
    Step 321Processing queue 1request 138from Node8 (8)to Node3 (3) Remain 11.521 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 11.521 Gbps, to route the capacity requirement from Node8 to Node3
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 11.521 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 20.126 19.874 1
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 26.002 13.998 1
    5 2 1 39.331 0.669 2
    6 1 1 25.614 14.386 1
    0 6 1 38.382 1.618 2
    11 9 1 25.534 14.466 1
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 29.064 10.936 2
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 25.608 14.392 2
  • Getting VL with max free capacity among VLs with common source destination {(12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (9, 7, 1): [13.998]}
  • List of VL ids with common source destination [(9, 7, 0), (9, 7, 1)]
    sdifreecapequal free capacities
    9 7 0 12.078
    9 7 1 13.998
  • Getting VL with max free capacity among VLs with common source destination {(12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (8, 3, 0): [19.874], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    12 9 10
    8 2 12 3 5
    4 7 2 9 12
    1 7 8
    9 7 10 8 12 3
    13 5 9 2 10 12 7
    11 6 9 12
    5 3 12 9
    7 6 2 11
    2 12 3 11 10 7 9
    10 2 1 9
    6 13 1 2 3 12
    0 6 11 5
    3 9
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    12 9 0 11.53
    8 2 0 11.701
    4 7 0 11.827
    1 7 0 11.911
    9 7 0 12.078
    8 12 0 12.188
    13 5 0 12.412
    11 6 0 12.51
    5 3 0 12.62
    4 2 0 12.755
    7 6 0 12.866
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    10 2 0 15.257
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    5 12 0 16.887
    0 6 0 18.526
    7 2 0 18.575
    8 3 0 19.874
    7 11 0 23.29
    0 11 0 28.835
    2 10 0 12.133
    1 8 0 13.622
    13 10 1 11.562
    12 10 1 12.128
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    6 1 1 14.386
    11 9 1 14.466
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 15.247
    3 9 1 14.392
  • [Finding shortest path with minimum hops] Input graph: {12: [9, 10], 8: [2, 12, 3, 5], 4: [7, 2, 9, 12], 1: [7, 8], 9: [7, 10, 8, 12, 3], 13: [5, 9, 2, 10, 12, 7], 11: [6, 9, 12], 5: [3, 12, 9], 7: [6, 2, 11], 2: [12, 3, 11, 10, 7, 9], 10: [2, 1, 9], 6: [13, 1, 2, 3, 12], 0: [6, 11, 5], 3: [9]}
  • Source: 8
  • Destination: 3
  • All paths [8, 3] .
  • Processing path [8, 3]
  • Path2links [[8, 3]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[8, 3]]
  • Subtract the utilised capacity from the Link's [8, 3] free capacity.
  • Update value is -11.521
  • Updated Virtual Link's (8,3,0) free capacity to 8.353.
  • que 1 req 138 (src 8 dst 3 num 0) type Grm capacity 11.521 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 138 VirtualLinkID: 111 (src: 8 dst: 3 ), Required Capacity: 11.521 Free Capacity (on the graph): 8.353 Free Capacity (on the corresponding array:) 8.353 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,3,0)[(0,110,20.126,'New'),(1,138,11.521,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,3,0)[31.647,8.353,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,138)[(8,3,0,'Grm',11.521,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step321_Que1_Req138.html

    Time of processing all requests 1903.191, Time of current queue's turn 3.191
    Step 322Processing queue 1request 139from Node3 (3)to Node7 (7) Remain 11.511 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 11.511 Gbps, to route the capacity requirement from Node3 to Node7
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 11.511 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 27.922 12.078 1
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 26.002 13.998 1
    5 2 1 39.331 0.669 2
    6 1 1 25.614 14.386 1
    0 6 1 38.382 1.618 2
    11 9 1 25.534 14.466 1
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 29.064 10.936 2
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 25.608 14.392 2
  • Getting VL with max free capacity among VLs with common source destination {(12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (9, 7, 1): [13.998]}
  • List of VL ids with common source destination [(9, 7, 0), (9, 7, 1)]
    sdifreecapequal free capacities
    9 7 0 12.078
    9 7 1 13.998
  • Getting VL with max free capacity among VLs with common source destination {(12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (9, 7, 0): [12.078], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    12 9 10
    8 2 12 5
    4 7 2 9 12
    1 7 8
    9 7 10 8 12 3
    13 5 9 2 10 12 7
    11 6 9 12
    5 3 12 9
    7 6 2 11
    2 12 3 11 10 7 9
    10 2 1 9
    6 13 1 2 3 12
    0 6 11 5
    3 9
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    12 9 0 11.53
    8 2 0 11.701
    4 7 0 11.827
    1 7 0 11.911
    9 7 0 12.078
    8 12 0 12.188
    13 5 0 12.412
    11 6 0 12.51
    5 3 0 12.62
    4 2 0 12.755
    7 6 0 12.866
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    10 2 0 15.257
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    5 12 0 16.887
    0 6 0 18.526
    7 2 0 18.575
    7 11 0 23.29
    0 11 0 28.835
    2 10 0 12.133
    1 8 0 13.622
    13 10 1 11.562
    12 10 1 12.128
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    6 1 1 14.386
    11 9 1 14.466
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 15.247
    3 9 1 14.392
  • [Finding shortest path with minimum hops] Input graph: {12: [9, 10], 8: [2, 12, 5], 4: [7, 2, 9, 12], 1: [7, 8], 9: [7, 10, 8, 12, 3], 13: [5, 9, 2, 10, 12, 7], 11: [6, 9, 12], 5: [3, 12, 9], 7: [6, 2, 11], 2: [12, 3, 11, 10, 7, 9], 10: [2, 1, 9], 6: [13, 1, 2, 3, 12], 0: [6, 11, 5], 3: [9]}
  • Source: 3
  • Destination: 7
  • All paths [3, 9, 7] .
  • Processing path [3, 9, 7]
  • Path2links [[3, 9], [9, 7]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[3, 9], [9, 7]]
  • Subtract the utilised capacity from the Link's [3, 9] free capacity.
  • Update value is -11.511
  • Updated Virtual Link's (3,9,1) free capacity to 2.881.
  • que 1 req 139 (src 3 dst 9 num 1) type Grm capacity 11.511 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 139 VirtualLinkID: 80 (src: 3 dst: 9 ), Required Capacity: 11.511 Free Capacity (on the graph): 2.881 Free Capacity (on the corresponding array:) -17.199 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [9, 7] free capacity.
  • Update value is -11.511
  • Updated Virtual Link's (9,7,0) free capacity to 0.567.
  • que 1 req 139 (src 9 dst 7 num 0) type Grm capacity 11.511 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 139 VirtualLinkID: 40 (src: 9 dst: 7 ), Required Capacity: 11.511 Free Capacity (on the graph): 0.567 Free Capacity (on the corresponding array:) 0.567 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,9,1)[(1,131,12.885,'New'),(1,133,12.723,'Grm'),(1,139,11.511,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,9,1)[37.119,2.881,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,139)[(3,9,1,'Grm',11.511,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(9,7,0)[(0,54,27.922,'New'),(1,139,11.511,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,7,0)[39.433,0.567,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,139)[(3,9,1,'Grm',11.511,0,0),(9,7,0,'Grm',11.511,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step322_Que1_Req139.html

    Time of processing all requests 1921.737, Time of current queue's turn 21.737
    Step 323Processing queue 1request 140from Node12 (12)to Node13 (13) Remain 11.224 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 11.224 Gbps, to route the capacity requirement from Node12 to Node13
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 11.224 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 28.47 11.53 1
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 27.134 12.866 1
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 24.006 15.994 1
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 26.002 13.998 1
    5 2 1 39.331 0.669 2
    6 1 1 25.614 14.386 1
    0 6 1 38.382 1.618 2
    11 9 1 25.534 14.466 1
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 29.064 10.936 2
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607]}
  • List of VL ids with common source destination [(6, 13, 0), (6, 13, 1)]
    sdifreecapequal free capacities
    6 13 0 15.994
    6 13 1 16.607
  • Getting VL with max free capacity among VLs with common source destination {(13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (12, 9, 0): [11.53], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (7, 6, 0): [12.866], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (6, 13, 0): [15.994], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (9, 7, 1): [13.998], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    13 11 0 5 9 2 10 12 7
    8 11 2 12 5
    4 3 7 2 8 9 12
    7 12 6 2 11
    12 9 10
    1 7 8 3
    11 6 9 12
    5 3 12 9
    2 12 3 11 10 7 9
    10 2 7 1 9
    6 13 1 2 3 12
    0 6 11 5
    9 10 8 12 7 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    13 11 0 11.259
    13 0 0 11.397
    8 11 0 11.414
    4 3 0 11.442
    7 12 0 11.445
    12 9 0 11.53
    8 2 0 11.701
    4 7 0 11.827
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    11 6 0 12.51
    5 3 0 12.62
    4 2 0 12.755
    7 6 0 12.866
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    10 2 0 15.257
    6 13 0 15.994
    2 3 0 16.363
    2 11 0 16.632
    5 12 0 16.887
    0 6 0 18.526
    7 2 0 18.575
    7 11 0 23.29
    4 8 0 11.276
    0 11 0 28.835
    2 10 0 12.133
    1 8 0 13.622
    1 3 0 11.374
    10 7 1 11.302
    13 10 1 11.562
    12 10 1 12.128
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    9 7 1 13.998
    6 1 1 14.386
    11 9 1 14.466
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {13: [11, 0, 5, 9, 2, 10, 12, 7], 8: [11, 2, 12, 5], 4: [3, 7, 2, 8, 9, 12], 7: [12, 6, 2, 11], 12: [9, 10], 1: [7, 8, 3], 11: [6, 9, 12], 5: [3, 12, 9], 2: [12, 3, 11, 10, 7, 9], 10: [2, 7, 1, 9], 6: [13, 1, 2, 3, 12], 0: [6, 11, 5], 9: [10, 8, 12, 7, 3]}
  • Source: 12
  • Destination: 13
  • All paths [12, 9, 7, 6, 13] .
  • Processing path [12, 9, 7, 6, 13]
  • Path2links [[12, 9], [9, 7], [7, 6], [6, 13]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[12, 9], [9, 7], [7, 6], [6, 13]]
  • Subtract the utilised capacity from the Link's [12, 9] free capacity.
  • Update value is -11.224
  • Updated Virtual Link's (12,9,0) free capacity to 0.306.
  • que 1 req 140 (src 12 dst 9 num 0) type Grm capacity 11.224 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 140 VirtualLinkID: 0 (src: 12 dst: 9 ), Required Capacity: 11.224 Free Capacity (on the graph): 0.306 Free Capacity (on the corresponding array:) 0.306 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [9, 7] free capacity.
  • Update value is -11.224
  • Updated Virtual Link's (9,7,1) free capacity to 2.774.
  • que 1 req 140 (src 9 dst 7 num 1) type Grm capacity 11.224 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 140 VirtualLinkID: 40 (src: 9 dst: 7 ), Required Capacity: 11.224 Free Capacity (on the graph): 2.774 Free Capacity (on the corresponding array:) -10.657 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [7, 6] free capacity.
  • Update value is -11.224
  • Updated Virtual Link's (7,6,0) free capacity to 1.642.
  • que 1 req 140 (src 7 dst 6 num 0) type Grm capacity 11.224 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 140 VirtualLinkID: 72 (src: 7 dst: 6 ), Required Capacity: 11.224 Free Capacity (on the graph): 1.642 Free Capacity (on the corresponding array:) -14.225 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [6, 13] free capacity.
  • Update value is -11.224
  • Updated Virtual Link's (6,13,0) free capacity to 4.770.
  • que 1 req 140 (src 6 dst 13 num 0) type Grm capacity 11.224 step of routing reqquested traffic 0 step's virtual link sequence number 3
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 140 VirtualLinkID: 82 (src: 6 dst: 13 ), Required Capacity: 11.224 Free Capacity (on the graph): 4.77 Free Capacity (on the corresponding array:) 4.77 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,9,0)[(0,49,28.470,'New'),(1,140,11.224,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,9,0)[39.694,0.306,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,140)[(12,9,0,'Grm',11.224,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(9,7,1)[(1,52,26.002,'New'),(1,140,11.224,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,7,1)[37.226,2.774,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,140)[(12,9,0,'Grm',11.224,0,0),(9,7,1,'Grm',11.224,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(7,6,0)[(0,61,27.134,'New'),(1,140,11.224,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,6,0)[38.358,1.642,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,140)[(12,9,0,'Grm',11.224,0,0),(9,7,1,'Grm',11.224,0,1),(7,6,0,'Grm',11.224,0,2)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(6,13,0)[(0,81,24.006,'New'),(1,140,11.224,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,13,0)[35.230,4.770,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,140)[(12,9,0,'Grm',11.224,0,0),(9,7,1,'Grm',11.224,0,1),(7,6,0,'Grm',11.224,0,2),(6,13,0,'Grm',11.224,0,3)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step323_Que1_Req140.html

    Time of processing all requests 1936.303, Time of current queue's turn 36.303
    Step 324Processing queue 1request 141from Node0 (0)to Node9 (9) Remain 11.083 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 11.083 Gbps, to route the capacity requirement from Node0 to Node9
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 11.083 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 11.165 28.835 1
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 25.614 14.386 1
    0 6 1 38.382 1.618 2
    11 9 1 25.534 14.466 1
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 29.064 10.936 2
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [28.835], (2, 10, 0): [12.133], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 9, 1): [14.466], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    0 8 6 11 5
    13 3 4 11 0 5 9 2 10 12 7
    8 11 2 12 5
    4 3 7 2 8 9 12
    7 12 2 11
    1 7 8 3
    11 6 9 12
    5 3 12 9
    2 12 3 11 10 7 9
    10 2 7 1 9
    12 10
    9 10 8 12 3
    6 1 2 13 3 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    0 8 0 11.151
    13 3 0 11.153
    13 4 0 11.175
    13 11 0 11.259
    13 0 0 11.397
    8 11 0 11.414
    4 3 0 11.442
    7 12 0 11.445
    8 2 0 11.701
    4 7 0 11.827
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    11 6 0 12.51
    5 3 0 12.62
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    10 2 0 15.257
    2 3 0 16.363
    2 11 0 16.632
    5 12 0 16.887
    0 6 0 18.526
    7 2 0 18.575
    7 11 0 23.29
    4 8 0 11.276
    0 11 0 28.835
    2 10 0 12.133
    1 8 0 13.622
    1 3 0 11.374
    10 7 1 11.302
    13 10 1 11.562
    12 10 1 12.128
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    6 1 1 14.386
    11 9 1 14.466
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 16.607
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {0: [8, 6, 11, 5], 13: [3, 4, 11, 0, 5, 9, 2, 10, 12, 7], 8: [11, 2, 12, 5], 4: [3, 7, 2, 8, 9, 12], 7: [12, 2, 11], 1: [7, 8, 3], 11: [6, 9, 12], 5: [3, 12, 9], 2: [12, 3, 11, 10, 7, 9], 10: [2, 7, 1, 9], 12: [10], 9: [10, 8, 12, 3], 6: [1, 2, 13, 3, 12]}
  • Source: 0
  • Destination: 9
  • All paths [0, 11, 9] .
  • Processing path [0, 11, 9]
  • Path2links [[0, 11], [11, 9]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[0, 11], [11, 9]]
  • Subtract the utilised capacity from the Link's [0, 11] free capacity.
  • Update value is -11.083
  • Updated Virtual Link's (0,11,0) free capacity to 17.752.
  • que 1 req 141 (src 0 dst 11 num 0) type Grm capacity 11.083 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 141 VirtualLinkID: 150 (src: 0 dst: 11 ), Required Capacity: 11.083 Free Capacity (on the graph): 17.752 Free Capacity (on the corresponding array:) 17.752 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [11, 9] free capacity.
  • Update value is -11.083
  • Updated Virtual Link's (11,9,1) free capacity to 3.383.
  • que 1 req 141 (src 11 dst 9 num 1) type Grm capacity 11.083 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 141 VirtualLinkID: 142 (src: 11 dst: 9 ), Required Capacity: 11.083 Free Capacity (on the graph): 3.383 Free Capacity (on the corresponding array:) -10.385 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(0,11,0)[(0,149,11.165,'New'),(1,141,11.083,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,11,0)[22.248,17.752,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,141)[(0,11,0,'Grm',11.083,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(11,9,1)[(1,57,25.534,'New'),(1,141,11.083,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,9,1)[36.617,3.383,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,141)[(0,11,0,'Grm',11.083,0,0),(11,9,1,'Grm',11.083,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step324_Que1_Req141.html

    Time of processing all requests 2034.104, Time of current queue's turn 34.104
    Step 325Processing queue 1request 142from Node5 (5)to Node11 (11) Remain 10.729 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 10.729 Gbps, to route the capacity requirement from Node5 to Node11
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 10.729 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 27.38 12.62 1
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 23.368 16.632 1
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 25.614 14.386 1
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 29.064 10.936 2
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (1, 5, 0): [10.804], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (1, 5, 0): [10.804], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (1, 5, 0): [10.804], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (1, 5, 0): [10.804], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (1, 5, 0): [10.804], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (1, 5, 0): [10.804], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (5, 3, 0): [12.62], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (2, 11, 0): [16.632], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (1, 5, 0): [10.804], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (3, 2, 1): [10.936], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 4 12 3 11 10 7 9
    4 11 3 7 2 8 9 12
    7 9 12 2 11
    0 1 8 6 11 5
    13 3 4 11 0 5 9 2 10 12 7
    8 11 2 12 5
    1 7 10 5 8 3
    11 6 12
    5 3 12 9
    10 2 7 1 9
    9 2 10 8 12 3
    12 10
    6 1 2 13 3 12
    3 2
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 4 0 10.787
    4 11 0 10.842
    7 9 0 10.995
    0 1 0 11.022
    0 8 0 11.151
    13 3 0 11.153
    13 4 0 11.175
    13 11 0 11.259
    13 0 0 11.397
    8 11 0 11.414
    4 3 0 11.442
    7 12 0 11.445
    8 2 0 11.701
    4 7 0 11.827
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    11 6 0 12.51
    5 3 0 12.62
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    10 2 0 15.257
    2 3 0 16.363
    2 11 0 16.632
    5 12 0 16.887
    0 6 0 18.526
    7 2 0 18.575
    7 11 0 23.29
    0 11 0 17.752
    2 10 0 12.133
    1 10 0 11.063
    1 5 0 10.804
    1 8 0 13.622
    1 3 0 11.374
    9 2 1 10.903
    4 8 1 10.962
    10 7 1 11.302
    13 10 1 11.562
    12 10 1 12.128
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    6 1 1 14.386
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 16.607
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    3 2 1 10.936
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {2: [4, 12, 3, 11, 10, 7, 9], 4: [11, 3, 7, 2, 8, 9, 12], 7: [9, 12, 2, 11], 0: [1, 8, 6, 11, 5], 13: [3, 4, 11, 0, 5, 9, 2, 10, 12, 7], 8: [11, 2, 12, 5], 1: [7, 10, 5, 8, 3], 11: [6, 12], 5: [3, 12, 9], 10: [2, 7, 1, 9], 9: [2, 10, 8, 12, 3], 12: [10], 6: [1, 2, 13, 3, 12], 3: [2]}
  • Source: 5
  • Destination: 11
  • All paths [5, 3, 2, 11] .
  • Processing path [5, 3, 2, 11]
  • Path2links [[5, 3], [3, 2], [2, 11]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[5, 3], [3, 2], [2, 11]]
  • Subtract the utilised capacity from the Link's [5, 3] free capacity.
  • Update value is -10.729
  • Updated Virtual Link's (5,3,0) free capacity to 1.891.
  • que 1 req 142 (src 5 dst 3 num 0) type Grm capacity 10.729 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 142 VirtualLinkID: 14 (src: 5 dst: 3 ), Required Capacity: 10.729 Free Capacity (on the graph): 1.891 Free Capacity (on the corresponding array:) 1.891 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [3, 2] free capacity.
  • Update value is -10.729
  • Updated Virtual Link's (3,2,1) free capacity to 0.207.
  • que 1 req 142 (src 3 dst 2 num 1) type Grm capacity 10.729 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 142 VirtualLinkID: 153 (src: 3 dst: 2 ), Required Capacity: 10.729 Free Capacity (on the graph): 0.207 Free Capacity (on the corresponding array:) -14.776 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [2, 11] free capacity.
  • Update value is -10.729
  • Updated Virtual Link's (2,11,0) free capacity to 5.903.
  • que 1 req 142 (src 2 dst 11 num 0) type Grm capacity 10.729 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 142 VirtualLinkID: 88 (src: 2 dst: 11 ), Required Capacity: 10.729 Free Capacity (on the graph): 5.903 Free Capacity (on the corresponding array:) -9.752 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(5,3,0)[(0,59,27.380,'New'),(1,142,10.729,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,3,0)[38.109,1.891,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,142)[(5,3,0,'Grm',10.729,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,2,1)[(1,116,15.335,'New'),(1,126,13.729,'Grm'),(1,142,10.729,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,2,1)[39.793,0.207,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,142)[(5,3,0,'Grm',10.729,0,0),(3,2,1,'Grm',10.729,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(2,11,0)[(0,87,23.368,'New'),(1,142,10.729,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,11,0)[34.097,5.903,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,142)[(5,3,0,'Grm',10.729,0,0),(3,2,1,'Grm',10.729,0,1),(2,11,0,'Grm',10.729,0,2)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step325_Que1_Req142.html

    Time of processing all requests 2048.804, Time of current queue's turn 48.804
    Step 326Processing queue 1request 143from Node11 (11)to Node8 (8) Remain 10.691 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 10.691 Gbps, to route the capacity requirement from Node11 to Node8
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 10.691 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 27.49 12.51 1
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 26.378 13.622 2
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 25.614 14.386 1
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (1, 5, 0): [10.804], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (1, 5, 0): [10.804], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (1, 5, 0): [10.804], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (1, 5, 0): [10.804], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (1, 5, 0): [10.804], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (1, 5, 0): [10.804], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (11, 6, 0): [12.51], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (1, 5, 0): [10.804], (1, 8, 0): [13.622], (1, 3, 0): [11.374], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (6, 1, 1): [14.386], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 4 12 3 10 7 9
    4 11 3 7 2 8 9 12
    7 9 12 2 11
    0 1 8 6 11 5
    13 3 4 11 0 5 9 2 10 12 7
    8 11 2 12 5
    1 7 10 5 8 3
    11 6 12
    10 2 7 1 9
    5 12 9
    6 7 1 2 13 3 12
    9 2 10 8 12 3
    12 10
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 4 0 10.787
    4 11 0 10.842
    7 9 0 10.995
    0 1 0 11.022
    0 8 0 11.151
    13 3 0 11.153
    13 4 0 11.175
    13 11 0 11.259
    13 0 0 11.397
    8 11 0 11.414
    4 3 0 11.442
    7 12 0 11.445
    8 2 0 11.701
    4 7 0 11.827
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    11 6 0 12.51
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    10 2 0 15.257
    2 3 0 16.363
    5 12 0 16.887
    0 6 0 18.526
    7 2 0 18.575
    7 11 0 23.29
    0 11 0 17.752
    2 10 0 12.133
    1 10 0 11.063
    1 5 0 10.804
    1 8 0 13.622
    1 3 0 11.374
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    10 7 1 11.302
    13 10 1 11.562
    12 10 1 12.128
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    6 1 1 14.386
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 16.607
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {2: [4, 12, 3, 10, 7, 9], 4: [11, 3, 7, 2, 8, 9, 12], 7: [9, 12, 2, 11], 0: [1, 8, 6, 11, 5], 13: [3, 4, 11, 0, 5, 9, 2, 10, 12, 7], 8: [11, 2, 12, 5], 1: [7, 10, 5, 8, 3], 11: [6, 12], 10: [2, 7, 1, 9], 5: [12, 9], 6: [7, 1, 2, 13, 3, 12], 9: [2, 10, 8, 12, 3], 12: [10]}
  • Source: 11
  • Destination: 8
  • All paths [11, 6, 1, 8] .
  • Processing path [11, 6, 1, 8]
  • Path2links [[11, 6], [6, 1], [1, 8]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[11, 6], [6, 1], [1, 8]]
  • Subtract the utilised capacity from the Link's [11, 6] free capacity.
  • Update value is -10.691
  • Updated Virtual Link's (11,6,0) free capacity to 1.819.
  • que 1 req 143 (src 11 dst 6 num 0) type Grm capacity 10.691 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 143 VirtualLinkID: 0 (src: 11 dst: 6 ), Required Capacity: 10.691 Free Capacity (on the graph): 1.819 Free Capacity (on the corresponding array:) 1.819 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [6, 1] free capacity.
  • Update value is -10.691
  • Updated Virtual Link's (6,1,1) free capacity to 3.695.
  • que 1 req 143 (src 6 dst 1 num 1) type Grm capacity 10.691 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 143 VirtualLinkID: 113 (src: 6 dst: 1 ), Required Capacity: 10.691 Free Capacity (on the graph): 3.695 Free Capacity (on the corresponding array:) -7.827 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [1, 8] free capacity.
  • Update value is -10.691
  • Updated Virtual Link's (1,8,0) free capacity to 2.931.
  • que 1 req 143 (src 1 dst 8 num 0) type Grm capacity 10.691 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 143 VirtualLinkID: 179 (src: 1 dst: 8 ), Required Capacity: 10.691 Free Capacity (on the graph): 2.931 Free Capacity (on the corresponding array:) 2.931 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(11,6,0)[(0,58,27.490,'New'),(1,143,10.691,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,6,0)[38.181,1.819,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,143)[(11,6,0,'Grm',10.691,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(6,1,1)[(1,55,25.614,'New'),(1,143,10.691,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,1,1)[36.305,3.695,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,143)[(11,6,0,'Grm',10.691,0,0),(6,1,1,'Grm',10.691,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,8,0)[(0,178,5.971,'New'),(1,92,20.407,'Grm'),(1,143,10.691,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,8,0)[37.069,2.931,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,143)[(11,6,0,'Grm',10.691,0,0),(6,1,1,'Grm',10.691,0,1),(1,8,0,'Grm',10.691,0,2)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step326_Que1_Req143.html

    Time of processing all requests 2075.370, Time of current queue's turn 75.370
    Step 327Processing queue 1request 144from Node2 (2)to Node10 (10) Remain 10.595 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 10.595 Gbps, to route the capacity requirement from Node2 to Node10
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 10.595 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 27.867 12.133 2
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (2, 10, 0): [12.133], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 4 12 3 10 7 9
    4 11 3 7 2 8 9 12
    7 9 12 11 2
    0 1 8 6 11 5
    13 3 4 11 0 5 9 2 10 12 7
    8 11 2 12 5
    1 7 10 5 3
    10 2 7 1 9
    5 12 9
    3 7
    6 7 2 13 3 12
    9 2 10 8 12 3
    12 10
    11 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 4 0 10.787
    4 11 0 10.842
    7 9 0 10.995
    0 1 0 11.022
    0 8 0 11.151
    13 3 0 11.153
    13 4 0 11.175
    13 11 0 11.259
    13 0 0 11.397
    8 11 0 11.414
    4 3 0 11.442
    7 12 0 11.445
    8 2 0 11.701
    4 7 0 11.827
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    10 2 0 15.257
    2 3 0 16.363
    5 12 0 16.887
    0 6 0 18.526
    7 11 0 23.29
    0 11 0 17.752
    2 10 0 12.133
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    1 3 0 11.374
    7 2 1 10.654
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    10 7 1 11.302
    13 10 1 11.562
    12 10 1 12.128
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 16.607
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {2: [4, 12, 3, 10, 7, 9], 4: [11, 3, 7, 2, 8, 9, 12], 7: [9, 12, 11, 2], 0: [1, 8, 6, 11, 5], 13: [3, 4, 11, 0, 5, 9, 2, 10, 12, 7], 8: [11, 2, 12, 5], 1: [7, 10, 5, 3], 10: [2, 7, 1, 9], 5: [12, 9], 3: [7], 6: [7, 2, 13, 3, 12], 9: [2, 10, 8, 12, 3], 12: [10], 11: [12]}
  • Source: 2
  • Destination: 10
  • All paths [2, 10] .
  • Processing path [2, 10]
  • Path2links [[2, 10]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[2, 10]]
  • Subtract the utilised capacity from the Link's [2, 10] free capacity.
  • Update value is -10.595
  • Updated Virtual Link's (2,10,0) free capacity to 1.538.
  • que 1 req 144 (src 2 dst 10 num 0) type Grm capacity 10.595 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 144 VirtualLinkID: 159 (src: 2 dst: 10 ), Required Capacity: 10.595 Free Capacity (on the graph): 1.538 Free Capacity (on the corresponding array:) 1.538 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(2,10,0)[(0,158,9.638,'New'),(1,104,18.229,'Grm'),(1,144,10.595,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,10,0)[38.462,1.538,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,144)[(2,10,0,'Grm',10.595,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step327_Que1_Req144.html

    Time of processing all requests 2094.608, Time of current queue's turn 94.608
    Step 328Processing queue 1request 145from Node12 (12)to Node4 (4) Remain 10.516 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 10.516 Gbps, to route the capacity requirement from Node12 to Node4
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 10.516 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 29.213 10.787 1
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 24.743 15.257 1
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 27.872 12.128 1
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 10, 1): [10.548], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(2, 4, 0): [10.787], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (10, 2, 0): [15.257], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (12, 10, 1): [12.128], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 4 12 3 7 9
    4 11 3 7 2 8 9 12
    7 9 12 11 10 2
    0 1 8 6 11 5
    13 3 4 11 0 5 9 2 10 12 7
    8 11 2 12 5
    1 7 10 5 3
    10 2 7 1 9
    5 12 9
    3 7
    6 7 2 13 3 12
    9 2 10 8 12 3
    12 10
    11 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 4 0 10.787
    4 11 0 10.842
    7 9 0 10.995
    0 1 0 11.022
    0 8 0 11.151
    13 3 0 11.153
    13 4 0 11.175
    13 11 0 11.259
    13 0 0 11.397
    8 11 0 11.414
    4 3 0 11.442
    7 12 0 11.445
    8 2 0 11.701
    4 7 0 11.827
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    10 2 0 15.257
    2 3 0 16.363
    5 12 0 16.887
    0 6 0 18.526
    7 11 0 23.29
    0 11 0 17.752
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    1 3 0 11.374
    7 10 1 10.548
    7 2 1 10.654
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    10 7 1 11.302
    13 10 1 11.562
    12 10 1 12.128
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 16.607
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {2: [4, 12, 3, 7, 9], 4: [11, 3, 7, 2, 8, 9, 12], 7: [9, 12, 11, 10, 2], 0: [1, 8, 6, 11, 5], 13: [3, 4, 11, 0, 5, 9, 2, 10, 12, 7], 8: [11, 2, 12, 5], 1: [7, 10, 5, 3], 10: [2, 7, 1, 9], 5: [12, 9], 3: [7], 6: [7, 2, 13, 3, 12], 9: [2, 10, 8, 12, 3], 12: [10], 11: [12]}
  • Source: 12
  • Destination: 4
  • All paths [12, 10, 2, 4] .
  • Processing path [12, 10, 2, 4]
  • Path2links [[12, 10], [10, 2], [2, 4]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[12, 10], [10, 2], [2, 4]]
  • Subtract the utilised capacity from the Link's [12, 10] free capacity.
  • Update value is -10.516
  • Updated Virtual Link's (12,10,1) free capacity to 1.612.
  • que 1 req 145 (src 12 dst 10 num 1) type Grm capacity 10.516 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 145 VirtualLinkID: 86 (src: 12 dst: 10 ), Required Capacity: 10.516 Free Capacity (on the graph): 1.612 Free Capacity (on the corresponding array:) -9.873 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [10, 2] free capacity.
  • Update value is -10.516
  • Updated Virtual Link's (10,2,0) free capacity to 4.741.
  • que 1 req 145 (src 10 dst 2 num 0) type Grm capacity 10.516 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 145 VirtualLinkID: 0 (src: 10 dst: 2 ), Required Capacity: 10.516 Free Capacity (on the graph): 4.741 Free Capacity (on the corresponding array:) 4.741 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [2, 4] free capacity.
  • Update value is -10.516
  • Updated Virtual Link's (2,4,0) free capacity to 0.271.
  • que 1 req 145 (src 2 dst 4 num 0) type Grm capacity 10.516 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 145 VirtualLinkID: 0 (src: 2 dst: 4 ), Required Capacity: 10.516 Free Capacity (on the graph): 0.271 Free Capacity (on the corresponding array:) 0.271 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,10,1)[(1,36,27.872,'New'),(1,145,10.516,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,10,1)[38.388,1.612,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,145)[(12,10,1,'Grm',10.516,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(10,2,0)[(0,76,24.743,'New'),(1,145,10.516,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,2,0)[35.259,4.741,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,145)[(12,10,1,'Grm',10.516,0,0),(10,2,0,'Grm',10.516,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(2,4,0)[(0,37,29.213,'New'),(1,145,10.516,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,4,0)[39.729,0.271,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,145)[(12,10,1,'Grm',10.516,0,0),(10,2,0,'Grm',10.516,0,1),(2,4,0,'Grm',10.516,0,2)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step328_Que1_Req145.html

    Time of processing all requests 2105.459, Time of current queue's turn 5.459
    Step 329Processing queue 1request 146from Node10 (10)to Node11 (11) Remain 10.386 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 10.386 Gbps, to route the capacity requirement from Node10 to Node11
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 10.386 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 39.729 0.271 2
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 16.71 23.29 1
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 28.698 11.302 1
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(3, 5, 0): [10.472], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(3, 5, 0): [10.472], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(3, 5, 0): [10.472], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(3, 5, 0): [10.472], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(3, 5, 0): [10.472], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(3, 5, 0): [10.472], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(3, 5, 0): [10.472], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(3, 5, 0): [10.472], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 11, 0): [23.29], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (10, 7, 1): [11.302], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    3 5 7
    4 11 3 7 2 8 9 12
    7 9 12 11 10 2
    0 1 8 6 11 5
    13 3 4 11 0 5 9 2 10 12 7
    8 11 2 12 5
    1 7 10 5 3
    2 12 3 8 7 9
    5 12 9
    6 7 2 13 3 12
    9 2 10 8 12 3
    10 7 1 9
    11 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    3 5 0 10.472
    4 11 0 10.842
    7 9 0 10.995
    0 1 0 11.022
    0 8 0 11.151
    13 3 0 11.153
    13 4 0 11.175
    13 11 0 11.259
    13 0 0 11.397
    8 11 0 11.414
    4 3 0 11.442
    7 12 0 11.445
    8 2 0 11.701
    4 7 0 11.827
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    0 6 0 18.526
    7 11 0 23.29
    0 11 0 17.752
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    1 3 0 11.374
    2 8 1 10.47
    7 10 1 10.548
    7 2 1 10.654
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    10 7 1 11.302
    13 10 1 11.562
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 16.607
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {3: [5, 7], 4: [11, 3, 7, 2, 8, 9, 12], 7: [9, 12, 11, 10, 2], 0: [1, 8, 6, 11, 5], 13: [3, 4, 11, 0, 5, 9, 2, 10, 12, 7], 8: [11, 2, 12, 5], 1: [7, 10, 5, 3], 2: [12, 3, 8, 7, 9], 5: [12, 9], 6: [7, 2, 13, 3, 12], 9: [2, 10, 8, 12, 3], 10: [7, 1, 9], 11: [12]}
  • Source: 10
  • Destination: 11
  • All paths [10, 7, 11] .
  • Processing path [10, 7, 11]
  • Path2links [[10, 7], [7, 11]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[10, 7], [7, 11]]
  • Subtract the utilised capacity from the Link's [10, 7] free capacity.
  • Update value is -10.386
  • Updated Virtual Link's (10,7,1) free capacity to 0.916.
  • que 1 req 146 (src 10 dst 7 num 1) type Grm capacity 10.386 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 146 VirtualLinkID: 115 (src: 10 dst: 7 ), Required Capacity: 10.386 Free Capacity (on the graph): 0.916 Free Capacity (on the corresponding array:) -9.255 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [7, 11] free capacity.
  • Update value is -10.386
  • Updated Virtual Link's (7,11,0) free capacity to 12.904.
  • que 1 req 146 (src 7 dst 11 num 0) type Grm capacity 10.386 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 146 VirtualLinkID: 123 (src: 7 dst: 11 ), Required Capacity: 10.386 Free Capacity (on the graph): 12.904 Free Capacity (on the corresponding array:) 12.904 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(10,7,1)[(1,31,28.698,'New'),(1,146,10.386,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,7,1)[39.084,0.916,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,146)[(10,7,1,'Grm',10.386,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(7,11,0)[(0,122,16.710,'New'),(1,146,10.386,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,11,0)[27.096,12.904,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,146)[(10,7,1,'Grm',10.386,0,0),(7,11,0,'Grm',10.386,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step329_Que1_Req146.html

    Time of processing all requests 2131.456, Time of current queue's turn 31.456
    Step 330Processing queue 1request 147from Node4 (4)to Node5 (5) Remain 10.165 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 10.165 Gbps, to route the capacity requirement from Node4 to Node5
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 10.165 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 29.528 10.472 1
    2 4 0 39.729 0.271 2
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 28.558 11.442 1
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 27.096 12.904 2
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(6, 10, 0): [10.236], (3, 5, 0): [10.472], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(6, 10, 0): [10.236], (3, 5, 0): [10.472], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(6, 10, 0): [10.236], (3, 5, 0): [10.472], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(6, 10, 0): [10.236], (3, 5, 0): [10.472], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(6, 10, 0): [10.236], (3, 5, 0): [10.472], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(6, 10, 0): [10.236], (3, 5, 0): [10.472], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(6, 10, 0): [10.236], (3, 5, 0): [10.472], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(6, 10, 0): [10.236], (3, 5, 0): [10.472], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (4, 3, 0): [11.442], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    6 10 7 2 13 3 12
    3 5 7
    4 11 3 7 2 8 9 12
    7 9 12 11 10 2
    0 1 8 6 11 13 5
    13 3 4 11 0 5 9 2 10 12 7
    8 11 2 12 5
    1 7 10 5 3
    2 12 3 8 7 9
    5 12 9
    9 2 10 8 12 3
    10 1 9
    11 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    6 10 0 10.236
    3 5 0 10.472
    4 11 0 10.842
    7 9 0 10.995
    0 1 0 11.022
    0 8 0 11.151
    13 3 0 11.153
    13 4 0 11.175
    13 11 0 11.259
    13 0 0 11.397
    8 11 0 11.414
    4 3 0 11.442
    7 12 0 11.445
    8 2 0 11.701
    4 7 0 11.827
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    0 6 0 18.526
    7 11 0 12.904
    0 11 0 17.752
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    1 3 0 11.374
    0 13 1 10.207
    2 8 1 10.47
    7 10 1 10.548
    7 2 1 10.654
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 16.607
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {6: [10, 7, 2, 13, 3, 12], 3: [5, 7], 4: [11, 3, 7, 2, 8, 9, 12], 7: [9, 12, 11, 10, 2], 0: [1, 8, 6, 11, 13, 5], 13: [3, 4, 11, 0, 5, 9, 2, 10, 12, 7], 8: [11, 2, 12, 5], 1: [7, 10, 5, 3], 2: [12, 3, 8, 7, 9], 5: [12, 9], 9: [2, 10, 8, 12, 3], 10: [1, 9], 11: [12]}
  • Source: 4
  • Destination: 5
  • All paths [4, 3, 5] .
  • Processing path [4, 3, 5]
  • Path2links [[4, 3], [3, 5]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[4, 3], [3, 5]]
  • Subtract the utilised capacity from the Link's [4, 3] free capacity.
  • Update value is -10.165
  • Updated Virtual Link's (4,3,0) free capacity to 1.277.
  • que 1 req 147 (src 4 dst 3 num 0) type Grm capacity 10.165 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 147 VirtualLinkID: 13 (src: 4 dst: 3 ), Required Capacity: 10.165 Free Capacity (on the graph): 1.277 Free Capacity (on the corresponding array:) 1.277 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [3, 5] free capacity.
  • Update value is -10.165
  • Updated Virtual Link's (3,5,0) free capacity to 0.307.
  • que 1 req 147 (src 3 dst 5 num 0) type Grm capacity 10.165 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 147 VirtualLinkID: 0 (src: 3 dst: 5 ), Required Capacity: 10.165 Free Capacity (on the graph): 0.307 Free Capacity (on the corresponding array:) 0.307 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(4,3,0)[(0,47,28.558,'New'),(1,147,10.165,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,3,0)[38.723,1.277,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,147)[(4,3,0,'Grm',10.165,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,5,0)[(0,36,29.528,'New'),(1,147,10.165,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,5,0)[39.693,0.307,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,147)[(4,3,0,'Grm',10.165,0,0),(3,5,0,'Grm',10.165,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step330_Que1_Req147.html

    Time of processing all requests 2146.975, Time of current queue's turn 46.975
    Step 331Processing queue 1request 148from Node7 (7)to Node3 (3) Remain 10.158 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 10.158 Gbps, to route the capacity requirement from Node7 to Node3
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 10.158 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 29.158 10.842 1
    7 9 0 29.005 10.995 1
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 38.723 1.277 2
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 27.096 12.904 2
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 24.628 15.372 1
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(6, 10, 0): [10.236], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(6, 10, 0): [10.236], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(6, 10, 0): [10.236], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(6, 10, 0): [10.236], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(6, 10, 0): [10.236], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(6, 10, 0): [10.236], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (9, 3, 1): [15.372]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 15.372
  • Getting VL with max free capacity among VLs with common source destination {(6, 10, 0): [10.236], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(6, 10, 0): [10.236], (4, 11, 0): [10.842], (7, 9, 0): [10.995], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (9, 3, 1): [15.372], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    6 10 7 2 13 3 12
    4 11 7 2 8 9 12
    7 9 12 11 10 2
    0 1 8 6 11 13 5
    13 3 4 11 0 5 9 2 10 12 7
    8 11 2 12 5
    1 7 10 5 3
    2 12 3 8 7 9
    5 12 9
    3 7
    9 2 10 8 12 3
    10 1 9
    11 12
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    6 10 0 10.236
    4 11 0 10.842
    7 9 0 10.995
    0 1 0 11.022
    0 8 0 11.151
    13 3 0 11.153
    13 4 0 11.175
    13 11 0 11.259
    13 0 0 11.397
    8 11 0 11.414
    7 12 0 11.445
    8 2 0 11.701
    4 7 0 11.827
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    0 6 0 18.526
    7 11 0 12.904
    0 11 0 17.752
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    1 3 0 11.374
    0 13 1 10.207
    2 8 1 10.47
    7 10 1 10.548
    7 2 1 10.654
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    11 12 1 15.105
    9 3 1 15.372
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 16.607
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {6: [10, 7, 2, 13, 3, 12], 4: [11, 7, 2, 8, 9, 12], 7: [9, 12, 11, 10, 2], 0: [1, 8, 6, 11, 13, 5], 13: [3, 4, 11, 0, 5, 9, 2, 10, 12, 7], 8: [11, 2, 12, 5], 1: [7, 10, 5, 3], 2: [12, 3, 8, 7, 9], 5: [12, 9], 3: [7], 9: [2, 10, 8, 12, 3], 10: [1, 9], 11: [12]}
  • Source: 7
  • Destination: 3
  • All paths [7, 9, 3] .
  • Processing path [7, 9, 3]
  • Path2links [[7, 9], [9, 3]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[7, 9], [9, 3]]
  • Subtract the utilised capacity from the Link's [7, 9] free capacity.
  • Update value is -10.158
  • Updated Virtual Link's (7,9,0) free capacity to 0.837.
  • que 1 req 148 (src 7 dst 9 num 0) type Grm capacity 10.158 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 148 VirtualLinkID: 17 (src: 7 dst: 9 ), Required Capacity: 10.158 Free Capacity (on the graph): 0.837 Free Capacity (on the corresponding array:) 0.837 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [9, 3] free capacity.
  • Update value is -10.158
  • Updated Virtual Link's (9,3,1) free capacity to 5.214.
  • que 1 req 148 (src 9 dst 3 num 1) type Grm capacity 10.158 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 148 VirtualLinkID: 95 (src: 9 dst: 3 ), Required Capacity: 10.158 Free Capacity (on the graph): 5.214 Free Capacity (on the corresponding array:) 8.03 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(7,9,0)[(0,39,29.005,'New'),(1,148,10.158,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,9,0)[39.163,0.837,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,148)[(7,9,0,'Grm',10.158,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(9,3,1)[(1,65,24.628,'New'),(1,148,10.158,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,3,1)[34.786,5.214,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,148)[(7,9,0,'Grm',10.158,0,0),(9,3,1,'Grm',10.158,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step331_Que1_Req148.html

    Time of processing all requests 2169.024, Time of current queue's turn 69.024
    Step 332Processing queue 1request 149from Node4 (4)to Node11 (11) Remain 9.926 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 9.926 Gbps, to route the capacity requirement from Node4 to Node11
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 9.926 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 29.158 10.842 1
    7 9 0 39.163 0.837 2
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 38.723 1.277 2
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 27.096 12.904 2
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (4, 11, 0): [10.842], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (4, 11, 0): [10.842], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (4, 11, 0): [10.842], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (4, 11, 0): [10.842], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (4, 11, 0): [10.842], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (4, 11, 0): [10.842], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (4, 11, 0): [10.842], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    11 7 12
    9 4 3 2 10 8 12
    7 1 12 11 10 2
    5 7 12 9
    6 10 7 2 13 3 12
    4 11 7 2 8 9 12
    0 1 8 6 11 13 5
    13 3 4 11 0 5 9 2 10 12 7
    8 11 2 12 5
    1 7 10 5 3
    2 12 3 8 7 9
    3 7
    10 1 9
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    11 7 0 9.93
    9 4 0 9.984
    7 1 0 10.073
    5 7 0 10.087
    6 10 0 10.236
    4 11 0 10.842
    0 1 0 11.022
    0 8 0 11.151
    13 3 0 11.153
    13 4 0 11.175
    13 11 0 11.259
    13 0 0 11.397
    8 11 0 11.414
    7 12 0 11.445
    8 2 0 11.701
    4 7 0 11.827
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    7 11 0 12.904
    0 11 0 17.752
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    1 3 0 11.374
    0 13 1 10.207
    2 8 1 10.47
    7 10 1 10.548
    7 2 1 10.654
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 16.607
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {11: [7, 12], 9: [4, 3, 2, 10, 8, 12], 7: [1, 12, 11, 10, 2], 5: [7, 12, 9], 6: [10, 7, 2, 13, 3, 12], 4: [11, 7, 2, 8, 9, 12], 0: [1, 8, 6, 11, 13, 5], 13: [3, 4, 11, 0, 5, 9, 2, 10, 12, 7], 8: [11, 2, 12, 5], 1: [7, 10, 5, 3], 2: [12, 3, 8, 7, 9], 3: [7], 10: [1, 9]}
  • Source: 4
  • Destination: 11
  • All paths [4, 11] .
  • Processing path [4, 11]
  • Path2links [[4, 11]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[4, 11]]
  • Subtract the utilised capacity from the Link's [4, 11] free capacity.
  • Update value is -9.926
  • Updated Virtual Link's (4,11,0) free capacity to 0.916.
  • que 1 req 149 (src 4 dst 11 num 0) type Grm capacity 9.926 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 149 VirtualLinkID: 0 (src: 4 dst: 11 ), Required Capacity: 9.926 Free Capacity (on the graph): 0.916 Free Capacity (on the corresponding array:) 0.916 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(4,11,0)[(0,38,29.158,'New'),(1,149,9.926,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,11,0)[39.084,0.916,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,149)[(4,11,0,'Grm',9.926,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step332_Que1_Req149.html

    Time of processing all requests 2184.222, Time of current queue's turn 84.222
    Step 333Processing queue 1request 150from Node9 (9)to Node11 (11) Remain 9.865 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 9.865 Gbps, to route the capacity requirement from Node9 to Node11
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 9.865 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 28.586 11.414 1
    4 3 0 38.723 1.277 2
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 27.096 12.904 2
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 26.269 13.731 1
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (8, 11, 0): [11.414], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 8, 1): [13.731], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    11 7 12
    9 4 3 2 10 8 12
    7 1 12 11 9 10 2
    5 7 12 9
    6 10 7 2 13 3 12
    0 1 8 6 11 13 5
    13 3 4 11 0 5 9 2 10 12 7
    8 11 2 12 5
    4 7 2 8 9 12
    1 7 10 5 3
    2 12 3 8 7 9
    3 7
    10 1 9
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    11 7 0 9.93
    9 4 0 9.984
    7 1 0 10.073
    5 7 0 10.087
    6 10 0 10.236
    0 1 0 11.022
    0 8 0 11.151
    13 3 0 11.153
    13 4 0 11.175
    13 11 0 11.259
    13 0 0 11.397
    8 11 0 11.414
    7 12 0 11.445
    8 2 0 11.701
    4 7 0 11.827
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    7 11 0 12.904
    0 11 0 17.752
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    1 3 0 11.374
    7 9 1 9.904
    0 13 1 10.207
    2 8 1 10.47
    7 10 1 10.548
    7 2 1 10.654
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 8 1 13.731
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 16.607
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {11: [7, 12], 9: [4, 3, 2, 10, 8, 12], 7: [1, 12, 11, 9, 10, 2], 5: [7, 12, 9], 6: [10, 7, 2, 13, 3, 12], 0: [1, 8, 6, 11, 13, 5], 13: [3, 4, 11, 0, 5, 9, 2, 10, 12, 7], 8: [11, 2, 12, 5], 4: [7, 2, 8, 9, 12], 1: [7, 10, 5, 3], 2: [12, 3, 8, 7, 9], 3: [7], 10: [1, 9]}
  • Source: 9
  • Destination: 11
  • All paths [9, 8, 11] .
  • Processing path [9, 8, 11]
  • Path2links [[9, 8], [8, 11]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[9, 8], [8, 11]]
  • Subtract the utilised capacity from the Link's [9, 8] free capacity.
  • Update value is -9.865
  • Updated Virtual Link's (9,8,1) free capacity to 3.866.
  • que 1 req 150 (src 9 dst 8 num 1) type Grm capacity 9.865 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 150 VirtualLinkID: 140 (src: 9 dst: 8 ), Required Capacity: 9.865 Free Capacity (on the graph): 3.866 Free Capacity (on the corresponding array:) -6.175 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [8, 11] free capacity.
  • Update value is -9.865
  • Updated Virtual Link's (8,11,0) free capacity to 1.549.
  • que 1 req 150 (src 8 dst 11 num 0) type Grm capacity 9.865 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 150 VirtualLinkID: 11 (src: 8 dst: 11 ), Required Capacity: 9.865 Free Capacity (on the graph): 1.549 Free Capacity (on the corresponding array:) 1.549 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(9,8,1)[(1,48,26.269,'New'),(1,150,9.865,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,8,1)[36.134,3.866,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,150)[(9,8,1,'Grm',9.865,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,11,0)[(0,46,28.586,'New'),(1,150,9.865,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,11,0)[38.451,1.549,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,150)[(9,8,1,'Grm',9.865,0,0),(8,11,0,'Grm',9.865,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step333_Que1_Req150.html

    Time of processing all requests 2195.754, Time of current queue's turn 95.754
    Step 334Processing queue 1request 151from Node11 (11)to Node13 (13) Remain 9.603 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 9.603 Gbps, to route the capacity requirement from Node11 to Node13
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 9.603 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 30.229 9.771 1
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 27.096 12.904 2
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 28.626 11.374 2
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 30.282 9.718 1
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(5, 8, 0): [9.749], (11, 1, 0): [9.771], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (3, 13, 1): [9.718], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(5, 8, 0): [9.749], (11, 1, 0): [9.771], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (3, 13, 1): [9.718], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(5, 8, 0): [9.749], (11, 1, 0): [9.771], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (3, 13, 1): [9.718], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(5, 8, 0): [9.749], (11, 1, 0): [9.771], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (3, 13, 1): [9.718], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(5, 8, 0): [9.749], (11, 1, 0): [9.771], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (3, 13, 1): [9.718], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(5, 8, 0): [9.749], (11, 1, 0): [9.771], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (3, 13, 1): [9.718], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(5, 8, 0): [9.749], (11, 1, 0): [9.771], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (1, 3, 0): [11.374], (3, 13, 1): [9.718], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    5 8 7 12 9
    11 1 7 12
    9 4 3 2 10 12
    7 1 12 11 9 10 2
    6 10 7 2 13 3 12
    0 1 8 6 11 13 5
    13 3 4 11 0 5 9 2 10 12 7
    8 2 12 1 5
    4 7 2 8 9 12
    1 7 10 5 3
    2 12 3 8 7 9
    3 2 7 13
    10 1 9
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    5 8 0 9.749
    11 1 0 9.771
    11 7 0 9.93
    9 4 0 9.984
    7 1 0 10.073
    5 7 0 10.087
    6 10 0 10.236
    0 1 0 11.022
    0 8 0 11.151
    13 3 0 11.153
    13 4 0 11.175
    13 11 0 11.259
    13 0 0 11.397
    7 12 0 11.445
    8 2 0 11.701
    4 7 0 11.827
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    7 11 0 12.904
    0 11 0 17.752
    3 2 0 9.682
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    1 3 0 11.374
    3 13 1 9.718
    8 1 1 9.795
    7 9 1 9.904
    0 13 1 10.207
    2 8 1 10.47
    7 10 1 10.548
    7 2 1 10.654
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 16.607
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 12 1 24.764
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {5: [8, 7, 12, 9], 11: [1, 7, 12], 9: [4, 3, 2, 10, 12], 7: [1, 12, 11, 9, 10, 2], 6: [10, 7, 2, 13, 3, 12], 0: [1, 8, 6, 11, 13, 5], 13: [3, 4, 11, 0, 5, 9, 2, 10, 12, 7], 8: [2, 12, 1, 5], 4: [7, 2, 8, 9, 12], 1: [7, 10, 5, 3], 2: [12, 3, 8, 7, 9], 3: [2, 7, 13], 10: [1, 9]}
  • Source: 11
  • Destination: 13
  • All paths [11, 1, 3, 13] .
  • Processing path [11, 1, 3, 13]
  • Path2links [[11, 1], [1, 3], [3, 13]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[11, 1], [1, 3], [3, 13]]
  • Subtract the utilised capacity from the Link's [11, 1] free capacity.
  • Update value is -9.603
  • Updated Virtual Link's (11,1,0) free capacity to 0.168.
  • que 1 req 151 (src 11 dst 1 num 0) type Grm capacity 9.603 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 151 VirtualLinkID: 56 (src: 11 dst: 1 ), Required Capacity: 9.603 Free Capacity (on the graph): 0.168 Free Capacity (on the corresponding array:) -12.555 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [1, 3] free capacity.
  • Update value is -9.603
  • Updated Virtual Link's (1,3,0) free capacity to 1.771.
  • que 1 req 151 (src 1 dst 3 num 0) type Grm capacity 9.603 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 151 VirtualLinkID: 182 (src: 1 dst: 3 ), Required Capacity: 9.603 Free Capacity (on the graph): 1.771 Free Capacity (on the corresponding array:) 1.771 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [3, 13] free capacity.
  • Update value is -9.603
  • Updated Virtual Link's (3,13,1) free capacity to 0.115.
  • que 1 req 151 (src 3 dst 13 num 1) type Grm capacity 9.603 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 151 VirtualLinkID: 96 (src: 3 dst: 13 ), Required Capacity: 9.603 Free Capacity (on the graph): 0.115 Free Capacity (on the corresponding array:) -7.091 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(11,1,0)[(0,30,30.229,'New'),(1,151,9.603,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,1,0)[39.832,0.168,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,151)[(11,1,0,'Grm',9.603,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,3,0)[(0,181,5.227,'New'),(1,70,23.399,'Grm'),(1,151,9.603,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,3,0)[38.229,1.771,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,151)[(11,1,0,'Grm',9.603,0,0),(1,3,0,'Grm',9.603,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,13,1)[(1,17,30.282,'New'),(1,151,9.603,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,13,1)[39.885,0.115,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,151)[(11,1,0,'Grm',9.603,0,0),(1,3,0,'Grm',9.603,0,1),(3,13,1,'Grm',9.603,0,2)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step334_Que1_Req151.html

    Time of processing all requests 2216.705, Time of current queue's turn 16.705
    Step 335Processing queue 1request 152from Node4 (4)to Node10 (10) Remain 9.525 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 9.525 Gbps, to route the capacity requirement from Node4 to Node10
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 9.525 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 28.173 11.827 1
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 27.096 12.904 2
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 29.452 10.548 1
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • Getting VL with max free capacity among VLs with common source destination {(13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (4, 7, 0): [11.827], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 10, 1): [10.548], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    13 12 3 4 11 0 5 9 2 10 7
    5 8 7 12 9
    11 7 12
    9 4 3 2 10 12
    7 1 12 11 9 10 2
    6 10 7 2 13 3 12
    0 1 8 6 11 13 5
    8 2 12 1 5
    4 7 2 8 9 12
    1 7 10 5
    2 12 3 8 7 9
    3 2 7
    10 1 9
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    9 4 0 9.984
    7 1 0 10.073
    5 7 0 10.087
    6 10 0 10.236
    0 1 0 11.022
    0 8 0 11.151
    13 3 0 11.153
    13 4 0 11.175
    13 11 0 11.259
    13 0 0 11.397
    7 12 0 11.445
    8 2 0 11.701
    4 7 0 11.827
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    7 11 0 12.904
    0 11 0 17.752
    3 2 0 9.682
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    8 1 1 9.795
    7 9 1 9.904
    0 13 1 10.207
    2 8 1 10.47
    7 10 1 10.548
    7 2 1 10.654
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    2 7 1 12.229
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    10 9 1 12.947
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 16.607
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {13: [12, 3, 4, 11, 0, 5, 9, 2, 10, 7], 5: [8, 7, 12, 9], 11: [7, 12], 9: [4, 3, 2, 10, 12], 7: [1, 12, 11, 9, 10, 2], 6: [10, 7, 2, 13, 3, 12], 0: [1, 8, 6, 11, 13, 5], 8: [2, 12, 1, 5], 4: [7, 2, 8, 9, 12], 1: [7, 10, 5], 2: [12, 3, 8, 7, 9], 3: [2, 7], 10: [1, 9]}
  • Source: 4
  • Destination: 10
  • All paths [4, 7, 10] .
  • Processing path [4, 7, 10]
  • Path2links [[4, 7], [7, 10]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[4, 7], [7, 10]]
  • Subtract the utilised capacity from the Link's [4, 7] free capacity.
  • Update value is -9.525
  • Updated Virtual Link's (4,7,0) free capacity to 2.302.
  • que 1 req 152 (src 4 dst 7 num 0) type Grm capacity 9.525 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 152 VirtualLinkID: 0 (src: 4 dst: 7 ), Required Capacity: 9.525 Free Capacity (on the graph): 2.302 Free Capacity (on the corresponding array:) 2.302 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [7, 10] free capacity.
  • Update value is -9.525
  • Updated Virtual Link's (7,10,1) free capacity to 1.023.
  • que 1 req 152 (src 7 dst 10 num 1) type Grm capacity 9.525 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 152 VirtualLinkID: 136 (src: 7 dst: 10 ), Required Capacity: 9.525 Free Capacity (on the graph): 1.023 Free Capacity (on the corresponding array:) -6.111 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(4,7,0)[(0,51,28.173,'New'),(1,152,9.525,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,7,0)[37.698,2.302,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,152)[(4,7,0,'Grm',9.525,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(7,10,1)[(1,26,29.452,'New'),(1,152,9.525,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,10,1)[38.977,1.023,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,152)[(4,7,0,'Grm',9.525,0,0),(7,10,1,'Grm',9.525,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step335_Que1_Req152.html

    Time of processing all requests 2235.086, Time of current queue's turn 35.086
    Step 336Processing queue 1request 153from Node1 (1)to Node4 (4) Remain 9.019 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 9.019 Gbps, to route the capacity requirement from Node1 to Node4
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 9.019 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 30.614 9.386 1
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 27.096 12.904 2
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (1, 4, 0): [9.386], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (1, 4, 0): [9.386], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (1, 4, 0): [9.386], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (1, 4, 0): [9.386], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (1, 4, 0): [9.386], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (1, 4, 0): [9.386], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (1, 4, 0): [9.386], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (1, 4, 0): [9.386], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (1, 4, 0): [9.386], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (1, 4, 0): [9.386], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 7 12 3 5 8 9
    10 9 1
    1 4 7 10 5
    11 4 7 12
    13 12 3 4 11 0 5 9 2 10 7
    5 8 7 12 3 9
    9 4 3 2 10 12
    7 1 12 11 9 2
    6 10 7 2 13 3 12
    0 1 8 6 11 13 5
    8 2 12 1 5
    4 2 3 8 9 12
    3 2 7
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 7 0 9.025
    10 9 0 9.359
    1 4 0 9.386
    11 4 0 9.515
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    9 4 0 9.984
    7 1 0 10.073
    5 7 0 10.087
    6 10 0 10.236
    0 1 0 11.022
    0 8 0 11.151
    13 3 0 11.153
    13 4 0 11.175
    13 11 0 11.259
    13 0 0 11.397
    7 12 0 11.445
    8 2 0 11.701
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    7 11 0 12.904
    0 11 0 17.752
    2 5 0 9.262
    3 2 0 9.682
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    4 3 1 9.248
    5 3 1 9.35
    8 1 1 9.795
    7 9 1 9.904
    0 13 1 10.207
    2 8 1 10.47
    7 2 1 10.654
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 16.607
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {2: [7, 12, 3, 5, 8, 9], 10: [9, 1], 1: [4, 7, 10, 5], 11: [4, 7, 12], 13: [12, 3, 4, 11, 0, 5, 9, 2, 10, 7], 5: [8, 7, 12, 3, 9], 9: [4, 3, 2, 10, 12], 7: [1, 12, 11, 9, 2], 6: [10, 7, 2, 13, 3, 12], 0: [1, 8, 6, 11, 13, 5], 8: [2, 12, 1, 5], 4: [2, 3, 8, 9, 12], 3: [2, 7]}
  • Source: 1
  • Destination: 4
  • All paths [1, 4] .
  • Processing path [1, 4]
  • Path2links [[1, 4]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[1, 4]]
  • Subtract the utilised capacity from the Link's [1, 4] free capacity.
  • Update value is -9.019
  • Updated Virtual Link's (1,4,0) free capacity to 0.367.
  • que 1 req 153 (src 1 dst 4 num 0) type Grm capacity 9.019 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 153 VirtualLinkID: 0 (src: 1 dst: 4 ), Required Capacity: 9.019 Free Capacity (on the graph): 0.367 Free Capacity (on the corresponding array:) 0.367 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,4,0)[(0,26,30.614,'New'),(1,153,9.019,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,4,0)[39.633,0.367,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,153)[(1,4,0,'Grm',9.019,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step336_Que1_Req153.html

    Time of processing all requests 2257.471, Time of current queue's turn 57.471
    Step 337Processing queue 1request 154from Node2 (2)to Node4 (4) Remain 8.977 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 8.977 Gbps, to route the capacity requirement from Node2 to Node4
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 8.977 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 30.016 9.984 1
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 27.096 12.904 2
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 27.755 12.245 1
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (9, 4, 0): [9.984], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 9, 1): [12.245], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 7 12 3 5 8 9
    10 9 1
    11 4 7 12
    13 12 3 4 11 0 5 9 2 10 7
    5 8 7 12 3 9
    9 4 3 2 10 12
    7 1 12 11 9 2
    6 10 7 2 13 3 12
    0 1 8 6 11 13 5
    8 2 12 1 5
    1 7 10 5
    4 2 3 8 9 12
    3 2 7
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 7 0 9.025
    10 9 0 9.359
    11 4 0 9.515
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    9 4 0 9.984
    7 1 0 10.073
    5 7 0 10.087
    6 10 0 10.236
    0 1 0 11.022
    0 8 0 11.151
    13 3 0 11.153
    13 4 0 11.175
    13 11 0 11.259
    13 0 0 11.397
    7 12 0 11.445
    8 2 0 11.701
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    7 11 0 12.904
    0 11 0 17.752
    2 5 0 9.262
    3 2 0 9.682
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    4 3 1 9.248
    5 3 1 9.35
    8 1 1 9.795
    7 9 1 9.904
    0 13 1 10.207
    2 8 1 10.47
    7 2 1 10.654
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    2 9 1 12.245
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 16.607
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {2: [7, 12, 3, 5, 8, 9], 10: [9, 1], 11: [4, 7, 12], 13: [12, 3, 4, 11, 0, 5, 9, 2, 10, 7], 5: [8, 7, 12, 3, 9], 9: [4, 3, 2, 10, 12], 7: [1, 12, 11, 9, 2], 6: [10, 7, 2, 13, 3, 12], 0: [1, 8, 6, 11, 13, 5], 8: [2, 12, 1, 5], 1: [7, 10, 5], 4: [2, 3, 8, 9, 12], 3: [2, 7]}
  • Source: 2
  • Destination: 4
  • All paths [2, 9, 4] .
  • Processing path [2, 9, 4]
  • Path2links [[2, 9], [9, 4]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[2, 9], [9, 4]]
  • Subtract the utilised capacity from the Link's [2, 9] free capacity.
  • Update value is -8.977
  • Updated Virtual Link's (2,9,1) free capacity to 3.268.
  • que 1 req 154 (src 2 dst 9 num 1) type Grm capacity 8.977 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 154 VirtualLinkID: 108 (src: 2 dst: 9 ), Required Capacity: 8.977 Free Capacity (on the graph): 3.268 Free Capacity (on the corresponding array:) -8.327 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [9, 4] free capacity.
  • Update value is -8.977
  • Updated Virtual Link's (9,4,0) free capacity to 1.007.
  • que 1 req 154 (src 9 dst 4 num 0) type Grm capacity 8.977 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 154 VirtualLinkID: 0 (src: 9 dst: 4 ), Required Capacity: 8.977 Free Capacity (on the graph): 1.007 Free Capacity (on the corresponding array:) 1.007 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(2,9,1)[(1,38,27.755,'New'),(1,154,8.977,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,9,1)[36.732,3.268,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,154)[(2,9,1,'Grm',8.977,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(9,4,0)[(0,32,30.016,'New'),(1,154,8.977,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,4,0)[38.993,1.007,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,154)[(2,9,1,'Grm',8.977,0,0),(9,4,0,'Grm',8.977,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step337_Que1_Req154.html

    Time of processing all requests 2267.749, Time of current queue's turn 67.749
    Step 338Processing queue 1request 155from Node6 (6)to Node4 (4) Remain 8.925 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 8.925 Gbps, to route the capacity requirement from Node6 to Node4
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 8.925 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 28.825 11.175 1
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 27.096 12.904 2
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 23.393 16.607 1
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 4, 0): [11.175], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [16.607], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 7 12 3 5 8
    10 9 1
    11 4 7 12
    13 12 3 4 11 0 5 9 2 10 7
    5 8 7 12 3 9
    7 1 12 11 9 2
    6 10 7 2 13 3 12
    0 1 8 6 11 4 13 5
    8 2 12 1 5
    1 7 10 5
    4 2 3 8 9 12
    9 3 2 10 12
    3 2 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 7 0 9.025
    10 9 0 9.359
    11 4 0 9.515
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    5 7 0 10.087
    6 10 0 10.236
    0 1 0 11.022
    0 8 0 11.151
    13 3 0 11.153
    13 4 0 11.175
    13 11 0 11.259
    13 0 0 11.397
    7 12 0 11.445
    8 2 0 11.701
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    7 11 0 12.904
    0 11 0 17.752
    2 5 0 9.262
    3 2 0 9.682
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    12 5 0 8.929
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    8 1 1 9.795
    7 9 1 9.904
    0 13 1 10.207
    2 8 1 10.47
    7 2 1 10.654
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 16.607
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {2: [7, 12, 3, 5, 8], 10: [9, 1], 11: [4, 7, 12], 13: [12, 3, 4, 11, 0, 5, 9, 2, 10, 7], 5: [8, 7, 12, 3, 9], 7: [1, 12, 11, 9, 2], 6: [10, 7, 2, 13, 3, 12], 0: [1, 8, 6, 11, 4, 13, 5], 8: [2, 12, 1, 5], 1: [7, 10, 5], 4: [2, 3, 8, 9, 12], 9: [3, 2, 10, 12], 3: [2, 7], 12: [5]}
  • Source: 6
  • Destination: 4
  • All paths [6, 13, 4] .
  • Processing path [6, 13, 4]
  • Path2links [[6, 13], [13, 4]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[6, 13], [13, 4]]
  • Subtract the utilised capacity from the Link's [6, 13] free capacity.
  • Update value is -8.925
  • Updated Virtual Link's (6,13,1) free capacity to 7.682.
  • que 1 req 155 (src 6 dst 13 num 1) type Grm capacity 8.925 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 155 VirtualLinkID: 82 (src: 6 dst: 13 ), Required Capacity: 8.925 Free Capacity (on the graph): 7.682 Free Capacity (on the corresponding array:) -4.155 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [13, 4] free capacity.
  • Update value is -8.925
  • Updated Virtual Link's (13,4,0) free capacity to 2.250.
  • que 1 req 155 (src 13 dst 4 num 0) type Grm capacity 8.925 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 155 VirtualLinkID: 61 (src: 13 dst: 4 ), Required Capacity: 8.925 Free Capacity (on the graph): 2.25 Free Capacity (on the corresponding array:) -15.292 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(6,13,1)[(1,72,23.393,'New'),(1,155,8.925,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,13,1)[32.318,7.682,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,155)[(6,13,1,'Grm',8.925,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(13,4,0)[(0,43,28.825,'New'),(1,155,8.925,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,4,0)[37.750,2.250,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,155)[(6,13,1,'Grm',8.925,0,0),(13,4,0,'Grm',8.925,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step338_Que1_Req155.html

    Time of processing all requests 2290.225, Time of current queue's turn 90.225
    Step 339Processing queue 1request 156from Node0 (0)to Node7 (7) Remain 8.902 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 8.902 Gbps, to route the capacity requirement from Node0 to Node7
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 8.902 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 28.978 11.022 1
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 28.089 11.911 1
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 27.096 12.904 2
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 1, 0): [11.022], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (1, 7, 0): [11.911], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 7, 1): [25.849], (1, 7, 1): [12.152]}
  • List of VL ids with common source destination [(1, 7, 0), (1, 7, 1)]
    sdifreecapequal free capacities
    1 7 0 11.911
    1 7 1 12.152
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 7 12 3 5 8
    10 9 1
    11 4 7 12
    13 12 3 11 0 5 9 2 10 7
    5 8 7 12 3 9
    7 1 12 11 9 2
    6 10 7 2 3 12
    0 1 8 6 11 4 13 5
    8 2 12 1 5
    1 7 10 5
    4 2 3 8 9 12
    9 3 2 10 12
    3 2 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 7 0 9.025
    10 9 0 9.359
    11 4 0 9.515
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    5 7 0 10.087
    6 10 0 10.236
    0 1 0 11.022
    0 8 0 11.151
    13 3 0 11.153
    13 11 0 11.259
    13 0 0 11.397
    7 12 0 11.445
    8 2 0 11.701
    1 7 0 11.911
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    7 11 0 12.904
    0 11 0 17.752
    2 5 0 9.262
    3 2 0 9.682
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    12 5 0 8.929
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    8 1 1 9.795
    7 9 1 9.904
    0 13 1 10.207
    2 8 1 10.47
    7 2 1 10.654
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {2: [7, 12, 3, 5, 8], 10: [9, 1], 11: [4, 7, 12], 13: [12, 3, 11, 0, 5, 9, 2, 10, 7], 5: [8, 7, 12, 3, 9], 7: [1, 12, 11, 9, 2], 6: [10, 7, 2, 3, 12], 0: [1, 8, 6, 11, 4, 13, 5], 8: [2, 12, 1, 5], 1: [7, 10, 5], 4: [2, 3, 8, 9, 12], 9: [3, 2, 10, 12], 3: [2, 7], 12: [5]}
  • Source: 0
  • Destination: 7
  • All paths [0, 1, 7] .
  • Processing path [0, 1, 7]
  • Path2links [[0, 1], [1, 7]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[0, 1], [1, 7]]
  • Subtract the utilised capacity from the Link's [0, 1] free capacity.
  • Update value is -8.902
  • Updated Virtual Link's (0,1,0) free capacity to 2.120.
  • que 1 req 156 (src 0 dst 1 num 0) type Grm capacity 8.902 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 156 VirtualLinkID: 0 (src: 0 dst: 1 ), Required Capacity: 8.902 Free Capacity (on the graph): 2.12 Free Capacity (on the corresponding array:) 2.12 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [1, 7] free capacity.
  • Update value is -8.902
  • Updated Virtual Link's (1,7,0) free capacity to 3.009.
  • que 1 req 156 (src 1 dst 7 num 0) type Grm capacity 8.902 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 156 VirtualLinkID: 78 (src: 1 dst: 7 ), Required Capacity: 8.902 Free Capacity (on the graph): 3.009 Free Capacity (on the corresponding array:) -10.912 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(0,1,0)[(0,40,28.978,'New'),(1,156,8.902,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,1,0)[37.880,2.120,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,156)[(0,1,0,'Grm',8.902,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,7,0)[(0,53,28.089,'New'),(1,156,8.902,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,7,0)[36.991,3.009,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,156)[(0,1,0,'Grm',8.902,0,0),(1,7,0,'Grm',8.902,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step339_Que1_Req156.html

    Time of processing all requests 2305.359, Time of current queue's turn 5.359
    Step 340Processing queue 1request 157from Node0 (0)to Node1 (1) Remain 8.872 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 8.872 Gbps, to route the capacity requirement from Node0 to Node1
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 8.872 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 28.849 11.151 1
    13 3 0 28.847 11.153 1
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 27.096 12.904 2
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 30.205 9.795 1
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (0, 8, 0): [11.151], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (8, 1, 1): [9.795], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    2 7 12 3 5 8
    10 9 1
    11 4 7 12
    13 12 3 11 0 5 9 2 10 7
    5 8 7 12 3 9
    7 1 12 11 9 2
    6 10 7 2 3 12
    0 8 6 11 4 13 5
    8 2 12 1 5
    4 2 3 8 9 12
    9 3 2 10 12
    3 2 7
    1 10 5 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    2 7 0 9.025
    10 9 0 9.359
    11 4 0 9.515
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    5 7 0 10.087
    6 10 0 10.236
    0 8 0 11.151
    13 3 0 11.153
    13 11 0 11.259
    13 0 0 11.397
    7 12 0 11.445
    8 2 0 11.701
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    7 11 0 12.904
    0 11 0 17.752
    2 5 0 9.262
    3 2 0 9.682
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    12 5 0 8.929
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    8 1 1 9.795
    7 9 1 9.904
    0 13 1 10.207
    2 8 1 10.47
    7 2 1 10.654
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    1 7 1 12.152
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {2: [7, 12, 3, 5, 8], 10: [9, 1], 11: [4, 7, 12], 13: [12, 3, 11, 0, 5, 9, 2, 10, 7], 5: [8, 7, 12, 3, 9], 7: [1, 12, 11, 9, 2], 6: [10, 7, 2, 3, 12], 0: [8, 6, 11, 4, 13, 5], 8: [2, 12, 1, 5], 4: [2, 3, 8, 9, 12], 9: [3, 2, 10, 12], 3: [2, 7], 1: [10, 5, 7], 12: [5]}
  • Source: 0
  • Destination: 1
  • All paths [0, 8, 1] .
  • Processing path [0, 8, 1]
  • Path2links [[0, 8], [8, 1]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[0, 8], [8, 1]]
  • Subtract the utilised capacity from the Link's [0, 8] free capacity.
  • Update value is -8.872
  • Updated Virtual Link's (0,8,0) free capacity to 2.279.
  • que 1 req 157 (src 0 dst 8 num 0) type Grm capacity 8.872 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 157 VirtualLinkID: 0 (src: 0 dst: 8 ), Required Capacity: 8.872 Free Capacity (on the graph): 2.279 Free Capacity (on the corresponding array:) 2.279 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [8, 1] free capacity.
  • Update value is -8.872
  • Updated Virtual Link's (8,1,1) free capacity to 0.923.
  • que 1 req 157 (src 8 dst 1 num 1) type Grm capacity 8.872 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 157 VirtualLinkID: 133 (src: 8 dst: 1 ), Required Capacity: 8.872 Free Capacity (on the graph): 0.923 Free Capacity (on the corresponding array:) -6.651 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(0,8,0)[(0,41,28.849,'New'),(1,157,8.872,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,8,0)[37.721,2.279,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,157)[(0,8,0,'Grm',8.872,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,1,1)[(1,18,30.205,'New'),(1,157,8.872,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,1,1)[39.077,0.923,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,157)[(0,8,0,'Grm',8.872,0,0),(8,1,1,'Grm',8.872,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step340_Que1_Req157.html

    Time of processing all requests 2320.919, Time of current queue's turn 20.919
    Step 341Processing queue 1request 158from Node7 (7)to Node4 (4) Remain 8.761 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 8.761 Gbps, to route the capacity requirement from Node7 to Node4
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 8.761 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 30.485 9.515 1
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 28.847 11.153 1
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 27.096 12.904 2
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (3, 11, 0): [8.848], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (3, 11, 0): [8.848], (7, 11, 0): [12.904], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (3, 11, 0): [8.848], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (3, 11, 0): [8.848], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (3, 11, 0): [8.848], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (3, 11, 0): [8.848], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (3, 11, 0): [8.848], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (3, 11, 0): [8.848], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (11, 4, 0): [9.515], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (3, 11, 0): [8.848], (7, 11, 0): [12.904], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 12 9 1
    5 2 8 7 12 3 9
    2 7 12 3 5 8
    11 4 7 12
    13 12 3 11 0 5 9 2 10 7
    7 1 12 11 9 2
    6 10 7 2 3 12
    8 2 12 5
    4 2 3 8 9 12
    9 3 2 10 12
    0 6 11 4 13 5
    3 11 2 7
    1 10 5 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    11 4 0 9.515
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    5 7 0 10.087
    6 10 0 10.236
    13 3 0 11.153
    13 11 0 11.259
    13 0 0 11.397
    7 12 0 11.445
    8 2 0 11.701
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    3 11 0 8.848
    7 11 0 12.904
    0 11 0 17.752
    2 5 0 9.262
    3 2 0 9.682
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    12 5 0 8.929
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    2 8 1 10.47
    7 2 1 10.654
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    1 7 1 12.152
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {10: [12, 9, 1], 5: [2, 8, 7, 12, 3, 9], 2: [7, 12, 3, 5, 8], 11: [4, 7, 12], 13: [12, 3, 11, 0, 5, 9, 2, 10, 7], 7: [1, 12, 11, 9, 2], 6: [10, 7, 2, 3, 12], 8: [2, 12, 5], 4: [2, 3, 8, 9, 12], 9: [3, 2, 10, 12], 0: [6, 11, 4, 13, 5], 3: [11, 2, 7], 1: [10, 5, 7], 12: [5]}
  • Source: 7
  • Destination: 4
  • All paths [7, 11, 4] .
  • Processing path [7, 11, 4]
  • Path2links [[7, 11], [11, 4]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[7, 11], [11, 4]]
  • Subtract the utilised capacity from the Link's [7, 11] free capacity.
  • Update value is -8.761
  • Updated Virtual Link's (7,11,0) free capacity to 4.143.
  • que 1 req 158 (src 7 dst 11 num 0) type Grm capacity 8.761 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 158 VirtualLinkID: 123 (src: 7 dst: 11 ), Required Capacity: 8.761 Free Capacity (on the graph): 4.143 Free Capacity (on the corresponding array:) 4.143 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [11, 4] free capacity.
  • Update value is -8.761
  • Updated Virtual Link's (11,4,0) free capacity to 0.754.
  • que 1 req 158 (src 11 dst 4 num 0) type Grm capacity 8.761 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 158 VirtualLinkID: 0 (src: 11 dst: 4 ), Required Capacity: 8.761 Free Capacity (on the graph): 0.754 Free Capacity (on the corresponding array:) 0.754 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(7,11,0)[(0,122,16.710,'New'),(1,146,10.386,'Grm'),(1,158,8.761,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,11,0)[35.857,4.143,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,158)[(7,11,0,'Grm',8.761,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(11,4,0)[(0,27,30.485,'New'),(1,158,8.761,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,4,0)[39.246,0.754,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,158)[(7,11,0,'Grm',8.761,0,0),(11,4,0,'Grm',8.761,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step341_Que1_Req158.html

    Time of processing all requests 2335.723, Time of current queue's turn 35.723
    Step 342Processing queue 1request 159from Node3 (3)to Node8 (8) Remain 8.376 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 8.376 Gbps, to route the capacity requirement from Node3 to Node8
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 8.376 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 28.847 11.153 1
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 30.318 9.682 2
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 29.53 10.47 1
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (3, 2, 0): [9.682], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (2, 8, 1): [10.47], (7, 2, 1): [10.654], (6, 7, 1): [10.722], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 12 9 1
    5 2 8 7 12 3 9
    2 7 12 3 5 8
    13 12 3 11 0 5 9 2 10 7
    11 7 12
    7 1 12 9 2
    6 10 7 2 3 12
    8 2 12 11 5
    4 2 3 8 9 12
    9 3 2 10 12
    0 6 11 4 13 5
    3 11 2 7
    1 10 5 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    5 7 0 10.087
    6 10 0 10.236
    13 3 0 11.153
    13 11 0 11.259
    13 0 0 11.397
    7 12 0 11.445
    8 2 0 11.701
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    3 11 0 8.848
    0 11 0 17.752
    2 5 0 9.262
    3 2 0 9.682
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    12 5 0 8.929
    8 11 1 8.508
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    2 8 1 10.47
    7 2 1 10.654
    6 7 1 10.722
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    1 7 1 12.152
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {10: [12, 9, 1], 5: [2, 8, 7, 12, 3, 9], 2: [7, 12, 3, 5, 8], 13: [12, 3, 11, 0, 5, 9, 2, 10, 7], 11: [7, 12], 7: [1, 12, 9, 2], 6: [10, 7, 2, 3, 12], 8: [2, 12, 11, 5], 4: [2, 3, 8, 9, 12], 9: [3, 2, 10, 12], 0: [6, 11, 4, 13, 5], 3: [11, 2, 7], 1: [10, 5, 7], 12: [5]}
  • Source: 3
  • Destination: 8
  • All paths [3, 2, 8] .
  • Processing path [3, 2, 8]
  • Path2links [[3, 2], [2, 8]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[3, 2], [2, 8]]
  • Subtract the utilised capacity from the Link's [3, 2] free capacity.
  • Update value is -8.376
  • Updated Virtual Link's (3,2,0) free capacity to 1.306.
  • que 1 req 159 (src 3 dst 2 num 0) type Grm capacity 8.376 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 159 VirtualLinkID: 153 (src: 3 dst: 2 ), Required Capacity: 8.376 Free Capacity (on the graph): 1.306 Free Capacity (on the corresponding array:) -23.152 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [2, 8] free capacity.
  • Update value is -8.376
  • Updated Virtual Link's (2,8,1) free capacity to 2.094.
  • que 1 req 159 (src 2 dst 8 num 1) type Grm capacity 8.376 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 159 VirtualLinkID: 160 (src: 2 dst: 8 ), Required Capacity: 8.376 Free Capacity (on the graph): 2.094 Free Capacity (on the corresponding array:) -8.0 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,2,0)[(0,152,10.458,'New'),(1,95,19.860,'Grm'),(1,159,8.376,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,2,0)[38.694,1.306,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,159)[(3,2,0,'Grm',8.376,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(2,8,1)[(1,25,29.530,'New'),(1,159,8.376,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,8,1)[37.906,2.094,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,159)[(3,2,0,'Grm',8.376,0,0),(2,8,1,'Grm',8.376,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step342_Que1_Req159.html

    Time of processing all requests 2350.929, Time of current queue's turn 50.929
    Step 343Processing queue 1request 160from Node12 (12)to Node0 (0) Remain 8.095 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 8.095 Gbps, to route the capacity requirement from Node12 to Node0
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 8.095 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 29.913 10.087 1
    6 10 0 29.764 10.236 1
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 28.847 11.153 1
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 28.603 11.397 1
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 31.793 8.207 2
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 31.071 8.929 2
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (7, 13, 0): [8.207], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (7, 13, 0): [8.207], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (7, 13, 0): [8.207], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (7, 13, 0): [8.207], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (7, 13, 0): [8.207], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (7, 13, 0): [8.207], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (7, 13, 0): [8.207], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (7, 13, 0): [8.207], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (7, 13, 0): [8.207], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (5, 7, 0): [10.087], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (13, 0, 0): [11.397], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (7, 13, 0): [8.207], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 5, 0): [8.929], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    6 7 9 10 2 3 12
    5 1 2 8 7 12 3 9
    10 12 9 1
    2 7 12 3 5
    13 12 3 11 0 5 9 2 10 7
    11 7 12
    7 1 12 13 9 2
    8 2 12 3 11 5
    4 2 3 8 9 12
    9 3 5 2 10 12
    0 6 11 4 13 5
    3 11 7
    1 10 5 7
    12 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    6 7 0 8.224
    5 1 0 8.226
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    5 7 0 10.087
    6 10 0 10.236
    13 3 0 11.153
    13 11 0 11.259
    13 0 0 11.397
    7 12 0 11.445
    8 2 0 11.701
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    8 3 0 8.353
    9 5 0 8.243
    3 11 0 8.848
    0 11 0 17.752
    2 5 0 9.262
    7 13 0 8.207
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    12 5 0 8.929
    8 11 1 8.508
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    1 7 1 12.152
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {6: [7, 9, 10, 2, 3, 12], 5: [1, 2, 8, 7, 12, 3, 9], 10: [12, 9, 1], 2: [7, 12, 3, 5], 13: [12, 3, 11, 0, 5, 9, 2, 10, 7], 11: [7, 12], 7: [1, 12, 13, 9, 2], 8: [2, 12, 3, 11, 5], 4: [2, 3, 8, 9, 12], 9: [3, 5, 2, 10, 12], 0: [6, 11, 4, 13, 5], 3: [11, 7], 1: [10, 5, 7], 12: [5]}
  • Source: 12
  • Destination: 0
  • All paths [12, 5, 7, 13, 0] .
  • Processing path [12, 5, 7, 13, 0]
  • Path2links [[12, 5], [5, 7], [7, 13], [13, 0]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[12, 5], [5, 7], [7, 13], [13, 0]]
  • Subtract the utilised capacity from the Link's [12, 5] free capacity.
  • Update value is -8.095
  • Updated Virtual Link's (12,5,0) free capacity to 0.834.
  • que 1 req 160 (src 12 dst 5 num 0) type Grm capacity 8.095 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 160 VirtualLinkID: 177 (src: 12 dst: 5 ), Required Capacity: 8.095 Free Capacity (on the graph): 0.834 Free Capacity (on the corresponding array:) 0.834 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [5, 7] free capacity.
  • Update value is -8.095
  • Updated Virtual Link's (5,7,0) free capacity to 1.992.
  • que 1 req 160 (src 5 dst 7 num 0) type Grm capacity 8.095 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 160 VirtualLinkID: 0 (src: 5 dst: 7 ), Required Capacity: 8.095 Free Capacity (on the graph): 1.992 Free Capacity (on the corresponding array:) 1.992 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [7, 13] free capacity.
  • Update value is -8.095
  • Updated Virtual Link's (7,13,0) free capacity to 0.112.
  • que 1 req 160 (src 7 dst 13 num 0) type Grm capacity 8.095 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 160 VirtualLinkID: 154 (src: 7 dst: 13 ), Required Capacity: 8.095 Free Capacity (on the graph): 0.112 Free Capacity (on the corresponding array:) 0.112 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [13, 0] free capacity.
  • Update value is -8.095
  • Updated Virtual Link's (13,0,0) free capacity to 3.302.
  • que 1 req 160 (src 13 dst 0 num 0) type Grm capacity 8.095 step of routing reqquested traffic 0 step's virtual link sequence number 3
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 160 VirtualLinkID: 0 (src: 13 dst: 0 ), Required Capacity: 8.095 Free Capacity (on the graph): 3.302 Free Capacity (on the corresponding array:) 3.302 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,5,0)[(0,176,6.217,'New'),(1,63,24.854,'Grm'),(1,160,8.095,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,5,0)[39.166,0.834,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,160)[(12,5,0,'Grm',8.095,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(5,7,0)[(0,34,29.913,'New'),(1,160,8.095,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,7,0)[38.008,1.992,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,160)[(12,5,0,'Grm',8.095,0,0),(5,7,0,'Grm',8.095,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(7,13,0)[(0,153,10.357,'New'),(1,88,21.436,'Grm'),(1,160,8.095,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,13,0)[39.888,0.112,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,160)[(12,5,0,'Grm',8.095,0,0),(5,7,0,'Grm',8.095,0,1),(7,13,0,'Grm',8.095,0,2)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(13,0,0)[(0,45,28.603,'New'),(1,160,8.095,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,0,0)[36.698,3.302,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,160)[(12,5,0,'Grm',8.095,0,0),(5,7,0,'Grm',8.095,0,1),(7,13,0,'Grm',8.095,0,2),(13,0,0,'Grm',8.095,0,3)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step343_Que1_Req160.html

    Time of processing all requests 2365.734, Time of current queue's turn 65.734
    Step 344Processing queue 1request 161from Node5 (5)to Node6 (6) Remain 7.96 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 7.96 Gbps, to route the capacity requirement from Node5 to Node6
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 7.96 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 38.008 1.992 2
    6 10 0 29.764 10.236 1
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 28.847 11.153 1
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
  • Getting VL with max free capacity among VLs with common source destination {(11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    11 13 7 12
    6 7 9 10 2 3 12
    5 1 2 8 12 3 9
    10 12 9 1
    2 7 12 3 5
    13 12 3 11 5 9 2 10 7
    7 1 12 9 2
    8 2 12 3 11 5
    4 2 3 8 9 12
    9 3 5 2 10 12
    0 6 11 4 13 5
    3 11 7
    1 10 5 7
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    11 13 0 8.032
    6 7 0 8.224
    5 1 0 8.226
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    6 10 0 10.236
    13 3 0 11.153
    13 11 0 11.259
    7 12 0 11.445
    8 2 0 11.701
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    8 3 0 8.353
    9 5 0 8.243
    3 11 0 8.848
    0 11 0 17.752
    2 5 0 9.262
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    8 11 1 8.508
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    1 7 1 12.152
    8 5 1 15.247
  • [Finding shortest path with minimum hops] Input graph: {11: [13, 7, 12], 6: [7, 9, 10, 2, 3, 12], 5: [1, 2, 8, 12, 3, 9], 10: [12, 9, 1], 2: [7, 12, 3, 5], 13: [12, 3, 11, 5, 9, 2, 10, 7], 7: [1, 12, 9, 2], 8: [2, 12, 3, 11, 5], 4: [2, 3, 8, 9, 12], 9: [3, 5, 2, 10, 12], 0: [6, 11, 4, 13, 5], 3: [11, 7], 1: [10, 5, 7]}
  • Source: 5
  • Destination: 6
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 7.96
  • Adding a new virtual link from 5 to 6 .
  • A new virtual link (5, 6, 1) is created for queue 1 , request 161 , from Node5 to Node6 capacity requirement 7.96 Gbps, having free capacity 32.04 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 5 → 6 are = [5.524]
  • Capacities are [5.524]
  • que 1 req 161 (src 5 dst 6 num 1) type New capacity 7.960 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(5,6)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(5,6,1)[(1,161,7.960,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,6,1)[7.960,32.040,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,161)[(5,6,1,'New',7.960,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step344_Que1_Req161.html

    Time of processing all requests 2396.964, Time of current queue's turn 96.964
    Step 345Processing queue 1request 162from Node6 (6)to Node10 (10) Remain 7.941 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 7.941 Gbps, to route the capacity requirement from Node6 to Node10
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 7.941 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 38.008 1.992 2
    6 10 0 29.764 10.236 1
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 28.847 11.153 1
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 7.96 32.04 1
  • Getting VL with max free capacity among VLs with common source destination {(8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (6, 10, 0): [10.236], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    8 7 2 12 3 11 5
    11 13 7 12
    6 7 9 10 2 3 12
    5 1 2 8 12 3 9 6
    10 12 9 1
    2 7 12 3 5
    13 12 3 11 5 9 2 10 7
    7 1 12 9 2
    4 2 3 8 9 12
    9 3 5 2 10 12
    0 6 11 4 13 5
    3 11 7
    1 10 5 7
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    8 7 0 7.943
    11 13 0 8.032
    6 7 0 8.224
    5 1 0 8.226
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    6 10 0 10.236
    13 3 0 11.153
    13 11 0 11.259
    7 12 0 11.445
    8 2 0 11.701
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    8 3 0 8.353
    9 5 0 8.243
    3 11 0 8.848
    0 11 0 17.752
    2 5 0 9.262
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    8 11 1 8.508
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    1 7 1 12.152
    8 5 1 15.247
    5 6 1 32.04
  • [Finding shortest path with minimum hops] Input graph: {8: [7, 2, 12, 3, 11, 5], 11: [13, 7, 12], 6: [7, 9, 10, 2, 3, 12], 5: [1, 2, 8, 12, 3, 9, 6], 10: [12, 9, 1], 2: [7, 12, 3, 5], 13: [12, 3, 11, 5, 9, 2, 10, 7], 7: [1, 12, 9, 2], 4: [2, 3, 8, 9, 12], 9: [3, 5, 2, 10, 12], 0: [6, 11, 4, 13, 5], 3: [11, 7], 1: [10, 5, 7]}
  • Source: 6
  • Destination: 10
  • All paths [6, 10] .
  • Processing path [6, 10]
  • Path2links [[6, 10]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[6, 10]]
  • Subtract the utilised capacity from the Link's [6, 10] free capacity.
  • Update value is -7.941
  • Updated Virtual Link's (6,10,0) free capacity to 2.295.
  • que 1 req 162 (src 6 dst 10 num 0) type Grm capacity 7.941 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 162 VirtualLinkID: 0 (src: 6 dst: 10 ), Required Capacity: 7.941 Free Capacity (on the graph): 2.295 Free Capacity (on the corresponding array:) 2.295 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(6,10,0)[(0,35,29.764,'New'),(1,162,7.941,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,10,0)[37.705,2.295,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,162)[(6,10,0,'Grm',7.941,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step345_Que1_Req162.html

    Time of processing all requests 2408.089, Time of current queue's turn 8.089
    Step 346Processing queue 1request 163from Node7 (7)to Node13 (13) Remain 7.773 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 7.773 Gbps, to route the capacity requirement from Node7 to Node13
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 7.773 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 32.124 7.876 1
    8 7 0 32.057 7.943 1
    11 13 0 31.968 8.032 1
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 28.847 11.153 1
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 28.555 11.445 1
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 31.492 8.508 1
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 7.96 32.04 1
  • Getting VL with max free capacity among VLs with common source destination {(12, 8, 0): [7.876], (8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(12, 8, 0): [7.876], (8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(12, 8, 0): [7.876], (8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(12, 8, 0): [7.876], (8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(12, 8, 0): [7.876], (8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(12, 8, 0): [7.876], (8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(12, 8, 0): [7.876], (8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(12, 8, 0): [7.876], (8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(12, 8, 0): [7.876], (8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(12, 8, 0): [7.876], (8, 7, 0): [7.943], (11, 13, 0): [8.032], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (7, 12, 0): [11.445], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (8, 11, 1): [8.508], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    12 8
    8 7 2 12 3 11 5
    11 13 7 12
    6 7 9 2 3 12
    5 1 2 8 12 3 9 6
    10 12 9 1
    2 7 12 3 5
    13 12 3 11 5 9 2 10 7
    7 1 12 9 2
    4 2 3 8 9 12
    9 3 5 2 10 12
    0 6 11 4 13 5
    3 11 7
    1 10 5 7
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    12 8 0 7.876
    8 7 0 7.943
    11 13 0 8.032
    6 7 0 8.224
    5 1 0 8.226
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    13 3 0 11.153
    13 11 0 11.259
    7 12 0 11.445
    8 2 0 11.701
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    2 12 0 13.044
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    8 3 0 8.353
    9 5 0 8.243
    3 11 0 8.848
    0 11 0 17.752
    2 5 0 9.262
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    8 11 1 8.508
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    1 7 1 12.152
    8 5 1 15.247
    5 6 1 32.04
  • [Finding shortest path with minimum hops] Input graph: {12: [8], 8: [7, 2, 12, 3, 11, 5], 11: [13, 7, 12], 6: [7, 9, 2, 3, 12], 5: [1, 2, 8, 12, 3, 9, 6], 10: [12, 9, 1], 2: [7, 12, 3, 5], 13: [12, 3, 11, 5, 9, 2, 10, 7], 7: [1, 12, 9, 2], 4: [2, 3, 8, 9, 12], 9: [3, 5, 2, 10, 12], 0: [6, 11, 4, 13, 5], 3: [11, 7], 1: [10, 5, 7]}
  • Source: 7
  • Destination: 13
  • All paths [7, 12, 8, 11, 13] .
  • Processing path [7, 12, 8, 11, 13]
  • Path2links [[7, 12], [12, 8], [8, 11], [11, 13]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[7, 12], [12, 8], [8, 11], [11, 13]]
  • Subtract the utilised capacity from the Link's [7, 12] free capacity.
  • Update value is -7.773
  • Updated Virtual Link's (7,12,0) free capacity to 3.672.
  • que 1 req 163 (src 7 dst 12 num 0) type Grm capacity 7.773 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 163 VirtualLinkID: 0 (src: 7 dst: 12 ), Required Capacity: 7.773 Free Capacity (on the graph): 3.672 Free Capacity (on the corresponding array:) 3.672 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [12, 8] free capacity.
  • Update value is -7.773
  • Updated Virtual Link's (12,8,0) free capacity to 0.103.
  • que 1 req 163 (src 12 dst 8 num 0) type Grm capacity 7.773 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 163 VirtualLinkID: 31 (src: 12 dst: 8 ), Required Capacity: 7.773 Free Capacity (on the graph): 0.103 Free Capacity (on the corresponding array:) -11.606 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [8, 11] free capacity.
  • Update value is -7.773
  • Updated Virtual Link's (8,11,1) free capacity to 0.735.
  • que 1 req 163 (src 8 dst 11 num 1) type Grm capacity 7.773 step of routing reqquested traffic 0 step's virtual link sequence number 2
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 163 VirtualLinkID: 11 (src: 8 dst: 11 ), Required Capacity: 7.773 Free Capacity (on the graph): 0.735 Free Capacity (on the corresponding array:) -6.224 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [11, 13] free capacity.
  • Update value is -7.773
  • Updated Virtual Link's (11,13,0) free capacity to 0.259.
  • que 1 req 163 (src 11 dst 13 num 0) type Grm capacity 7.773 step of routing reqquested traffic 0 step's virtual link sequence number 3
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 163 VirtualLinkID: 0 (src: 11 dst: 13 ), Required Capacity: 7.773 Free Capacity (on the graph): 0.259 Free Capacity (on the corresponding array:) 0.259 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(7,12,0)[(0,48,28.555,'New'),(1,163,7.773,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,12,0)[36.328,3.672,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,163)[(7,12,0,'Grm',7.773,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,8,0)[(0,16,32.124,'New'),(1,163,7.773,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,8,0)[39.897,0.103,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,163)[(7,12,0,'Grm',7.773,0,0),(12,8,0,'Grm',7.773,0,1)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,11,1)[(1,11,31.492,'New'),(1,163,7.773,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,11,1)[39.265,0.735,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,163)[(7,12,0,'Grm',7.773,0,0),(12,8,0,'Grm',7.773,0,1),(8,11,1,'Grm',7.773,0,2)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(11,13,0)[(0,18,31.968,'New'),(1,163,7.773,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(11,13,0)[39.741,0.259,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,163)[(7,12,0,'Grm',7.773,0,0),(12,8,0,'Grm',7.773,0,1),(8,11,1,'Grm',7.773,0,2),(11,13,0,'Grm',7.773,0,3)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step346_Que1_Req163.html

    Time of processing all requests 2427.242, Time of current queue's turn 27.242
    Step 347Processing queue 1request 164from Node5 (5)to Node7 (7) Remain 7.615 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 7.615 Gbps, to route the capacity requirement from Node5 to Node7
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 7.615 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 31.774 8.226 1
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 28.847 11.153 1
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 27.848 12.152 2
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 7.96 32.04 1
  • Getting VL with max free capacity among VLs with common source destination {(7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (5, 1, 0): [8.226], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    7 3 1 9 2
    8 7 2 12 3 5
    6 7 9 2 13 3 12
    5 1 2 8 12 3 9 6
    10 12 9 1
    2 7 3 5 12
    13 12 3 11 5 9 2 10 7
    11 7 12
    4 2 3 8 9 12
    9 3 5 2 10 12
    0 6 11 4 13 5
    3 11 7
    1 10 5 7
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    5 1 0 8.226
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    13 3 0 11.153
    13 11 0 11.259
    8 2 0 11.701
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    8 3 0 8.353
    9 5 0 8.243
    3 11 0 8.848
    0 11 0 17.752
    2 5 0 9.262
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 7.682
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    1 7 1 12.152
    8 5 1 15.247
    5 6 1 32.04
  • [Finding shortest path with minimum hops] Input graph: {7: [3, 1, 9, 2], 8: [7, 2, 12, 3, 5], 6: [7, 9, 2, 13, 3, 12], 5: [1, 2, 8, 12, 3, 9, 6], 10: [12, 9, 1], 2: [7, 3, 5, 12], 13: [12, 3, 11, 5, 9, 2, 10, 7], 11: [7, 12], 4: [2, 3, 8, 9, 12], 9: [3, 5, 2, 10, 12], 0: [6, 11, 4, 13, 5], 3: [11, 7], 1: [10, 5, 7]}
  • Source: 5
  • Destination: 7
  • All paths [5, 1, 7] .
  • Processing path [5, 1, 7]
  • Path2links [[5, 1], [1, 7]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[5, 1], [1, 7]]
  • Subtract the utilised capacity from the Link's [5, 1] free capacity.
  • Update value is -7.615
  • Updated Virtual Link's (5,1,0) free capacity to 0.611.
  • que 1 req 164 (src 5 dst 1 num 0) type Grm capacity 7.615 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 164 VirtualLinkID: 0 (src: 5 dst: 1 ), Required Capacity: 7.615 Free Capacity (on the graph): 0.611 Free Capacity (on the corresponding array:) 0.611 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [1, 7] free capacity.
  • Update value is -7.615
  • Updated Virtual Link's (1,7,1) free capacity to 4.537.
  • que 1 req 164 (src 1 dst 7 num 1) type Grm capacity 7.615 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 164 VirtualLinkID: 78 (src: 1 dst: 7 ), Required Capacity: 7.615 Free Capacity (on the graph): 4.537 Free Capacity (on the corresponding array:) -18.527 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(5,1,0)[(0,20,31.774,'New'),(1,164,7.615,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,1,0)[39.389,0.611,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,164)[(5,1,0,'Grm',7.615,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,7,1)[(1,124,13.927,'New'),(1,125,13.921,'Grm'),(1,164,7.615,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,7,1)[35.463,4.537,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,164)[(5,1,0,'Grm',7.615,0,0),(1,7,1,'Grm',7.615,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step347_Que1_Req164.html

    Time of processing all requests 2451.173, Time of current queue's turn 51.173
    Step 348Processing queue 1request 165from Node13 (13)to Node6 (6) Remain 7.438 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 7.438 Gbps, to route the capacity requirement from Node13 to Node6
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 7.438 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 28.847 11.153 1
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 27.588 12.412 1
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 7.96 32.04 1
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (13, 5, 0): [12.412], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    3 10 11 7
    7 3 1 9 2
    8 7 2 12 3 5
    6 7 9 2 13 3 12
    10 12 9 8 1
    5 2 8 12 3 9 6
    2 7 3 5 12
    13 12 3 11 5 9 2 10 7
    11 7 12
    4 2 1 3 8 9 12
    9 3 11 5 2 10 12
    0 6 11 4 13 5
    1 10 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    3 10 0 7.47
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    13 3 0 11.153
    13 11 0 11.259
    8 2 0 11.701
    8 12 0 12.188
    13 5 0 12.412
    4 2 0 12.755
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    3 11 0 8.848
    4 1 0 7.575
    0 11 0 17.752
    2 5 0 9.262
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    10 8 1 7.521
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 7.682
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    8 5 1 15.247
    5 6 1 32.04
  • [Finding shortest path with minimum hops] Input graph: {3: [10, 11, 7], 7: [3, 1, 9, 2], 8: [7, 2, 12, 3, 5], 6: [7, 9, 2, 13, 3, 12], 10: [12, 9, 8, 1], 5: [2, 8, 12, 3, 9, 6], 2: [7, 3, 5, 12], 13: [12, 3, 11, 5, 9, 2, 10, 7], 11: [7, 12], 4: [2, 1, 3, 8, 9, 12], 9: [3, 11, 5, 2, 10, 12], 0: [6, 11, 4, 13, 5], 1: [10, 5]}
  • Source: 13
  • Destination: 6
  • All paths [13, 5, 6] .
  • Processing path [13, 5, 6]
  • Path2links [[13, 5], [5, 6]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[13, 5], [5, 6]]
  • Subtract the utilised capacity from the Link's [13, 5] free capacity.
  • Update value is -7.438
  • Updated Virtual Link's (13,5,0) free capacity to 4.974.
  • que 1 req 165 (src 13 dst 5 num 0) type Grm capacity 7.438 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 165 VirtualLinkID: 0 (src: 13 dst: 5 ), Required Capacity: 7.438 Free Capacity (on the graph): 4.974 Free Capacity (on the corresponding array:) 4.974 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [5, 6] free capacity.
  • Update value is -7.438
  • Updated Virtual Link's (5,6,1) free capacity to 24.602.
  • que 1 req 165 (src 5 dst 6 num 1) type Grm capacity 7.438 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 165 VirtualLinkID: 128 (src: 5 dst: 6 ), Required Capacity: 7.438 Free Capacity (on the graph): 24.602 Free Capacity (on the corresponding array:) -1.914 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(13,5,0)[(0,57,27.588,'New'),(1,165,7.438,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,5,0)[35.026,4.974,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,165)[(13,5,0,'Grm',7.438,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(5,6,1)[(1,161,7.960,'New'),(1,165,7.438,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,6,1)[15.398,24.602,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,165)[(13,5,0,'Grm',7.438,0,0),(5,6,1,'Grm',7.438,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step348_Que1_Req165.html

    Time of processing all requests 2464.542, Time of current queue's turn 64.542
    Step 349Processing queue 1request 166from Node13 (13)to Node3 (3) Remain 7.403 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 7.403 Gbps, to route the capacity requirement from Node13 to Node3
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 7.403 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 28.847 11.153 1
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 35.026 4.974 2
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 15.398 24.602 2
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 3, 0): [11.153], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    3 10 11 7
    7 3 1 9 2
    8 7 2 12 3 5
    6 7 9 2 13 3 12
    10 12 9 8 1
    5 2 8 12 3 9 6
    2 7 3 5 12
    13 12 3 11 9 2 10 7
    11 7 12
    4 2 1 3 8 9 12
    9 3 11 5 2 10 12
    0 6 11 4 13 5
    1 10 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    3 10 0 7.47
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    13 3 0 11.153
    13 11 0 11.259
    8 2 0 11.701
    8 12 0 12.188
    4 2 0 12.755
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    3 11 0 8.848
    4 1 0 7.575
    0 11 0 17.752
    2 5 0 9.262
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    10 8 1 7.521
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 7.682
    6 3 1 17.053
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    8 5 1 15.247
    5 6 1 24.602
  • [Finding shortest path with minimum hops] Input graph: {3: [10, 11, 7], 7: [3, 1, 9, 2], 8: [7, 2, 12, 3, 5], 6: [7, 9, 2, 13, 3, 12], 10: [12, 9, 8, 1], 5: [2, 8, 12, 3, 9, 6], 2: [7, 3, 5, 12], 13: [12, 3, 11, 9, 2, 10, 7], 11: [7, 12], 4: [2, 1, 3, 8, 9, 12], 9: [3, 11, 5, 2, 10, 12], 0: [6, 11, 4, 13, 5], 1: [10, 5]}
  • Source: 13
  • Destination: 3
  • All paths [13, 3] .
  • Processing path [13, 3]
  • Path2links [[13, 3]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[13, 3]]
  • Subtract the utilised capacity from the Link's [13, 3] free capacity.
  • Update value is -7.403
  • Updated Virtual Link's (13,3,0) free capacity to 3.750.
  • que 1 req 166 (src 13 dst 3 num 0) type Grm capacity 7.403 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 166 VirtualLinkID: 0 (src: 13 dst: 3 ), Required Capacity: 7.403 Free Capacity (on the graph): 3.75 Free Capacity (on the corresponding array:) 3.75 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(13,3,0)[(0,42,28.847,'New'),(1,166,7.403,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,3,0)[36.250,3.750,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,166)[(13,3,0,'Grm',7.403,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step349_Que1_Req166.html

    Time of processing all requests 2479.302, Time of current queue's turn 79.302
    Step 350Processing queue 1request 167from Node13 (13)to Node0 (0) Remain 6.644 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 6.644 Gbps, to route the capacity requirement from Node13 to Node0
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 6.644 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 36.25 3.75 2
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 35.026 4.974 2
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 15.398 24.602 2
  • Getting VL with max free capacity among VLs with common source destination {(0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (10, 4, 1): [7.212], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (10, 4, 1): [7.212], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (10, 4, 1): [7.212], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (10, 4, 1): [7.212], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (10, 4, 1): [7.212], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (10, 4, 1): [7.212], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (10, 4, 1): [7.212], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (10, 4, 1): [7.212], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (10, 4, 1): [7.212], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (10, 4, 1): [7.212], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (10, 4, 1): [7.212], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649]}
  • List of VL ids with common source destination [(3, 10, 0), (3, 10, 1)]
    sdifreecapequal free capacities
    3 10 0 7.47
    3 10 1 6.649
  • Getting VL with max free capacity among VLs with common source destination {(0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (10, 4, 1): [7.212], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    0 9 6 10 11 4 13 5
    3 9 8 11 7 10
    5 11 2 8 12 3 9 6
    7 3 1 9 2
    8 7 2 12 3 6 5
    6 7 9 2 13 3 12
    10 12 9 4 8 1
    2 7 3 5 12
    13 12 11 9 2 10 7
    11 7 12
    4 2 1 3 8 9 12
    9 3 11 5 2 10 12
    1 13 10 5
    12 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    0 9 0 6.691
    3 9 0 7.035
    5 11 0 7.114
    3 8 0 7.118
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    13 11 0 11.259
    8 2 0 11.701
    8 12 0 12.188
    4 2 0 12.755
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    0 10 0 7.152
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    3 11 0 8.848
    4 1 0 7.575
    0 11 0 17.752
    2 5 0 9.262
    1 13 0 6.708
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    12 3 1 7.101
    10 4 1 7.212
    8 6 1 7.358
    10 8 1 7.521
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 7.682
    6 3 1 17.053
    3 10 1 6.649
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    8 5 1 15.247
    5 6 1 24.602
  • [Finding shortest path with minimum hops] Input graph: {0: [9, 6, 10, 11, 4, 13, 5], 3: [9, 8, 11, 7, 10], 5: [11, 2, 8, 12, 3, 9, 6], 7: [3, 1, 9, 2], 8: [7, 2, 12, 3, 6, 5], 6: [7, 9, 2, 13, 3, 12], 10: [12, 9, 4, 8, 1], 2: [7, 3, 5, 12], 13: [12, 11, 9, 2, 10, 7], 11: [7, 12], 4: [2, 1, 3, 8, 9, 12], 9: [3, 11, 5, 2, 10, 12], 1: [13, 10, 5], 12: [3]}
  • Source: 13
  • Destination: 0
  • All paths [] .
  • Request not routed over existing paths, due to lack of free capacity on paths' links.
  • Remaining capacity for this request is 6.644
  • Adding a new virtual link from 13 to 0 .
  • A new virtual link (13, 0, 1) is created for queue 1 , request 167 , from Node13 to Node0 capacity requirement 6.644 Gbps, having free capacity 33.356 Gbps.
  • Neighbour not appended, since it is already in the neighbours list.
  • Link not appended, since it is already in the links list.
  • Capacities of the link 13 → 0 are = [3.302]
  • Capacities are [3.302]
  • que 1 req 167 (src 13 dst 0 num 1) type New capacity 6.644 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Update of the Virtual Link IDs
    {(s,d):[0,1,2,...],...}
    JustificationKeyValue
    Update key value(13,0)[0,1]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    New entry(13,0,1)[(1,167,6.644,'New')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(13,0,1)[6.644,33.356,1]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,167)[(13,0,1,'New',6.644,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step350_Que1_Req167.html

    Time of processing all requests 2491.357, Time of current queue's turn 91.357
    Step 351Processing queue 1request 168from Node0 (0)to Node11 (11) Remain 6.223 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 6.223 Gbps, to route the capacity requirement from Node0 to Node11
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 6.223 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 36.25 3.75 2
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 35.026 4.974 2
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 22.248 17.752 2
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 15.398 24.602 2
    13 0 1 6.644 33.356 1
  • Getting VL with max free capacity among VLs with common source destination {(10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (10, 4, 1): [7.212]}
  • List of VL ids with common source destination [(10, 4, 0), (10, 4, 1)]
    sdifreecapequal free capacities
    10 4 0 6.59
    10 4 1 7.212
  • Getting VL with max free capacity among VLs with common source destination {(10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649]}
  • List of VL ids with common source destination [(3, 10, 0), (3, 10, 1)]
    sdifreecapequal free capacities
    3 10 0 7.47
    3 10 1 6.649
  • Getting VL with max free capacity among VLs with common source destination {(10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (4, 1, 0): [7.575], (0, 11, 0): [17.752], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    10 4 12 9 8 1
    0 9 6 10 11 4 13 5
    3 9 8 11 7 10
    5 11 2 8 12 3 9 6
    7 3 1 9 2
    8 7 2 12 3 6 5
    6 7 9 2 13 3 12
    2 7 3 5 12
    13 12 11 9 2 10 7 0
    11 7 12
    4 2 1 3 8 9 12
    9 3 11 5 2 10 12
    12 6 3
    1 13 10 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    10 4 0 6.59
    0 9 0 6.691
    3 9 0 7.035
    5 11 0 7.114
    3 8 0 7.118
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    13 11 0 11.259
    8 2 0 11.701
    8 12 0 12.188
    4 2 0 12.755
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    0 10 0 7.152
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    3 11 0 8.848
    12 6 0 6.567
    4 1 0 7.575
    0 11 0 17.752
    2 5 0 9.262
    1 13 0 6.708
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    12 3 1 7.101
    8 6 1 7.358
    10 8 1 7.521
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 7.682
    6 3 1 17.053
    3 10 1 6.649
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    8 5 1 15.247
    5 6 1 24.602
    13 0 1 33.356
  • [Finding shortest path with minimum hops] Input graph: {10: [4, 12, 9, 8, 1], 0: [9, 6, 10, 11, 4, 13, 5], 3: [9, 8, 11, 7, 10], 5: [11, 2, 8, 12, 3, 9, 6], 7: [3, 1, 9, 2], 8: [7, 2, 12, 3, 6, 5], 6: [7, 9, 2, 13, 3, 12], 2: [7, 3, 5, 12], 13: [12, 11, 9, 2, 10, 7, 0], 11: [7, 12], 4: [2, 1, 3, 8, 9, 12], 9: [3, 11, 5, 2, 10, 12], 12: [6, 3], 1: [13, 10, 5]}
  • Source: 0
  • Destination: 11
  • All paths [0, 11] .
  • Processing path [0, 11]
  • Path2links [[0, 11]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[0, 11]]
  • Subtract the utilised capacity from the Link's [0, 11] free capacity.
  • Update value is -6.223
  • Updated Virtual Link's (0,11,0) free capacity to 11.529.
  • que 1 req 168 (src 0 dst 11 num 0) type Grm capacity 6.223 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 168 VirtualLinkID: 150 (src: 0 dst: 11 ), Required Capacity: 6.223 Free Capacity (on the graph): 11.529 Free Capacity (on the corresponding array:) 11.529 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(0,11,0)[(0,149,11.165,'New'),(1,141,11.083,'Grm'),(1,168,6.223,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,11,0)[28.471,11.529,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,168)[(0,11,0,'Grm',6.223,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step351_Que1_Req168.html

    Time of processing all requests 2503.930, Time of current queue's turn 3.930
    Step 352Processing queue 1request 169from Node4 (4)to Node1 (1) Remain 6.078 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 6.078 Gbps, to route the capacity requirement from Node4 to Node1
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 6.078 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 36.25 3.75 2
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 35.026 4.974 2
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 32.425 7.575 2
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 28.471 11.529 3
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 15.398 24.602 2
    13 0 1 6.644 33.356 1
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (10, 4, 1): [7.212]}
  • List of VL ids with common source destination [(10, 4, 0), (10, 4, 1)]
    sdifreecapequal free capacities
    10 4 0 6.59
    10 4 1 7.212
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (4, 1, 0): [7.575], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (4, 1, 0): [7.575], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (4, 1, 0): [7.575], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (4, 1, 0): [7.575], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (4, 1, 0): [7.575], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (4, 1, 0): [7.575], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (4, 1, 0): [7.575], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (4, 1, 0): [7.575], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649]}
  • List of VL ids with common source destination [(3, 10, 0), (3, 10, 1)]
    sdifreecapequal free capacities
    3 10 0 7.47
    3 10 1 6.649
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (4, 1, 0): [7.575], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 13 2 1 3 8 9 12
    10 4 12 9 8 1
    0 9 6 10 11 4 13 5
    3 9 8 11 7 10
    5 11 2 8 12 3 9 6
    7 3 1 8 9 2
    8 7 2 12 3 6 5
    6 7 9 2 13 3 12
    2 7 3 5 12
    13 12 11 9 2 10 7 0
    11 7 12
    9 3 11 5 2 10 12
    12 6 3
    1 13 10 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 13 0 6.216
    10 4 0 6.59
    0 9 0 6.691
    3 9 0 7.035
    5 11 0 7.114
    3 8 0 7.118
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    13 11 0 11.259
    8 2 0 11.701
    8 12 0 12.188
    4 2 0 12.755
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    0 10 0 7.152
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    3 11 0 8.848
    12 6 0 6.567
    7 8 0 6.131
    4 1 0 7.575
    0 11 0 11.529
    2 5 0 9.262
    1 13 0 6.708
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    12 3 1 7.101
    8 6 1 7.358
    10 8 1 7.521
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 7.682
    6 3 1 17.053
    3 10 1 6.649
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    8 5 1 15.247
    5 6 1 24.602
    13 0 1 33.356
  • [Finding shortest path with minimum hops] Input graph: {4: [13, 2, 1, 3, 8, 9, 12], 10: [4, 12, 9, 8, 1], 0: [9, 6, 10, 11, 4, 13, 5], 3: [9, 8, 11, 7, 10], 5: [11, 2, 8, 12, 3, 9, 6], 7: [3, 1, 8, 9, 2], 8: [7, 2, 12, 3, 6, 5], 6: [7, 9, 2, 13, 3, 12], 2: [7, 3, 5, 12], 13: [12, 11, 9, 2, 10, 7, 0], 11: [7, 12], 9: [3, 11, 5, 2, 10, 12], 12: [6, 3], 1: [13, 10, 5]}
  • Source: 4
  • Destination: 1
  • All paths [4, 1] .
  • Processing path [4, 1]
  • Path2links [[4, 1]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[4, 1]]
  • Subtract the utilised capacity from the Link's [4, 1] free capacity.
  • Update value is -6.078
  • Updated Virtual Link's (4,1,0) free capacity to 1.497.
  • que 1 req 169 (src 4 dst 1 num 0) type Grm capacity 6.078 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 169 VirtualLinkID: 145 (src: 4 dst: 1 ), Required Capacity: 6.078 Free Capacity (on the graph): 1.497 Free Capacity (on the corresponding array:) 1.497 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(4,1,0)[(0,144,12.300,'New'),(1,94,20.125,'Grm'),(1,169,6.078,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,1,0)[38.503,1.497,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,169)[(4,1,0,'Grm',6.078,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step352_Que1_Req169.html

    Time of processing all requests 2524.643, Time of current queue's turn 24.643
    Step 353Processing queue 1request 170from Node8 (8)to Node2 (2) Remain 5.942 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 5.942 Gbps, to route the capacity requirement from Node8 to Node2
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 5.942 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 36.25 3.75 2
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 28.299 11.701 1
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 35.026 4.974 2
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 38.503 1.497 3
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 28.471 11.529 3
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 15.398 24.602 2
    13 0 1 6.644 33.356 1
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 4, 1): [7.212]}
  • List of VL ids with common source destination [(10, 4, 0), (10, 4, 1)]
    sdifreecapequal free capacities
    10 4 0 6.59
    10 4 1 7.212
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649]}
  • List of VL ids with common source destination [(3, 10, 0), (3, 10, 1)]
    sdifreecapequal free capacities
    3 10 0 7.47
    3 10 1 6.649
  • Getting VL with max free capacity among VLs with common source destination {(4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 2, 0): [11.701], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    4 13 2 3 8 9 12
    10 4 12 9 8 1
    0 9 6 10 11 4 13 5
    3 9 8 11 7 10
    5 11 2 8 12 3 9 6
    7 3 1 8 11 9 2
    8 7 2 12 3 6 5
    6 7 9 2 13 3 12
    2 7 3 5 12
    13 12 11 9 2 10 7 0
    11 7 12
    9 3 11 5 0 2 10 12
    12 6 3
    1 13 10 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    4 13 0 6.216
    10 4 0 6.59
    0 9 0 6.691
    3 9 0 7.035
    5 11 0 7.114
    3 8 0 7.118
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    13 11 0 11.259
    8 2 0 11.701
    8 12 0 12.188
    4 2 0 12.755
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    0 10 0 7.152
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    3 11 0 8.848
    12 6 0 6.567
    7 8 0 6.131
    9 0 0 6.026
    0 11 0 11.529
    2 5 0 9.262
    1 13 0 6.708
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    7 11 1 5.985
    12 3 1 7.101
    8 6 1 7.358
    10 8 1 7.521
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 7.682
    6 3 1 17.053
    3 10 1 6.649
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    8 5 1 15.247
    5 6 1 24.602
    13 0 1 33.356
  • [Finding shortest path with minimum hops] Input graph: {4: [13, 2, 3, 8, 9, 12], 10: [4, 12, 9, 8, 1], 0: [9, 6, 10, 11, 4, 13, 5], 3: [9, 8, 11, 7, 10], 5: [11, 2, 8, 12, 3, 9, 6], 7: [3, 1, 8, 11, 9, 2], 8: [7, 2, 12, 3, 6, 5], 6: [7, 9, 2, 13, 3, 12], 2: [7, 3, 5, 12], 13: [12, 11, 9, 2, 10, 7, 0], 11: [7, 12], 9: [3, 11, 5, 0, 2, 10, 12], 12: [6, 3], 1: [13, 10, 5]}
  • Source: 8
  • Destination: 2
  • All paths [8, 2] .
  • Processing path [8, 2]
  • Path2links [[8, 2]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[8, 2]]
  • Subtract the utilised capacity from the Link's [8, 2] free capacity.
  • Update value is -5.942
  • Updated Virtual Link's (8,2,0) free capacity to 5.759.
  • que 1 req 170 (src 8 dst 2 num 0) type Grm capacity 5.942 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 170 VirtualLinkID: 0 (src: 8 dst: 2 ), Required Capacity: 5.942 Free Capacity (on the graph): 5.759 Free Capacity (on the corresponding array:) 5.759 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,2,0)[(0,50,28.299,'New'),(1,170,5.942,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,2,0)[34.241,5.759,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,170)[(8,2,0,'Grm',5.942,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step353_Que1_Req170.html

    Time of processing all requests 2536.586, Time of current queue's turn 36.586
    Step 354Processing queue 1request 171from Node12 (12)to Node2 (2) Remain 5.843 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 5.843 Gbps, to route the capacity requirement from Node12 to Node2
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 5.843 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 36.25 3.75 2
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 34.241 5.759 2
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 35.026 4.974 2
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 33.433 6.567 2
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 38.503 1.497 3
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 28.471 11.529 3
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 24.514 15.486 1
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 15.398 24.602 2
    13 0 1 6.644 33.356 1
  • Getting VL with max free capacity among VLs with common source destination {(13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 4, 1): [7.212]}
  • List of VL ids with common source destination [(10, 4, 0), (10, 4, 1)]
    sdifreecapequal free capacities
    10 4 0 6.59
    10 4 1 7.212
  • Getting VL with max free capacity among VLs with common source destination {(13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649]}
  • List of VL ids with common source destination [(3, 10, 0), (3, 10, 1)]
    sdifreecapequal free capacities
    3 10 0 7.47
    3 10 1 6.649
  • Getting VL with max free capacity among VLs with common source destination {(13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (12, 6, 0): [6.567], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [15.486], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    13 1 12 11 9 2 10 7 0
    4 13 2 3 8 9 12
    10 4 12 9 8 1
    0 9 6 10 11 4 13 5
    3 9 8 11 7 10
    5 11 2 8 12 3 9 6
    7 3 1 8 11 9 2
    8 7 12 3 6 5
    6 7 9 2 13 3 12
    2 7 3 11 5 12
    11 7 12
    9 3 11 5 0 2 10 12
    12 6 3
    1 13 10 5
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    13 1 0 5.866
    4 13 0 6.216
    10 4 0 6.59
    0 9 0 6.691
    3 9 0 7.035
    5 11 0 7.114
    3 8 0 7.118
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    13 11 0 11.259
    8 12 0 12.188
    4 2 0 12.755
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    2 11 0 5.903
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    0 10 0 7.152
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    3 11 0 8.848
    12 6 0 6.567
    7 8 0 6.131
    9 0 0 6.026
    0 11 0 11.529
    2 5 0 9.262
    1 13 0 6.708
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    7 11 1 5.985
    12 3 1 7.101
    8 6 1 7.358
    10 8 1 7.521
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 15.486
    4 12 1 16.094
    6 13 1 7.682
    6 3 1 17.053
    3 10 1 6.649
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    8 5 1 15.247
    5 6 1 24.602
    13 0 1 33.356
  • [Finding shortest path with minimum hops] Input graph: {13: [1, 12, 11, 9, 2, 10, 7, 0], 4: [13, 2, 3, 8, 9, 12], 10: [4, 12, 9, 8, 1], 0: [9, 6, 10, 11, 4, 13, 5], 3: [9, 8, 11, 7, 10], 5: [11, 2, 8, 12, 3, 9, 6], 7: [3, 1, 8, 11, 9, 2], 8: [7, 12, 3, 6, 5], 6: [7, 9, 2, 13, 3, 12], 2: [7, 3, 11, 5, 12], 11: [7, 12], 9: [3, 11, 5, 0, 2, 10, 12], 12: [6, 3], 1: [13, 10, 5]}
  • Source: 12
  • Destination: 2
  • All paths [12, 6, 2] .
  • Processing path [12, 6, 2]
  • Path2links [[12, 6], [6, 2]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[12, 6], [6, 2]]
  • Subtract the utilised capacity from the Link's [12, 6] free capacity.
  • Update value is -5.843
  • Updated Virtual Link's (12,6,0) free capacity to 0.724.
  • que 1 req 171 (src 12 dst 6 num 0) type Grm capacity 5.843 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 171 VirtualLinkID: 130 (src: 12 dst: 6 ), Required Capacity: 5.843 Free Capacity (on the graph): 0.724 Free Capacity (on the corresponding array:) 0.724 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [6, 2] free capacity.
  • Update value is -5.843
  • Updated Virtual Link's (6,2,1) free capacity to 9.643.
  • que 1 req 171 (src 6 dst 2 num 1) type Grm capacity 5.843 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 171 VirtualLinkID: 125 (src: 6 dst: 2 ), Required Capacity: 5.843 Free Capacity (on the graph): 9.643 Free Capacity (on the corresponding array:) -4.638 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(12,6,0)[(0,129,15.891,'New'),(1,106,17.542,'Grm'),(1,171,5.843,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(12,6,0)[39.276,0.724,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,171)[(12,6,0,'Grm',5.843,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(6,2,1)[(1,67,24.514,'New'),(1,171,5.843,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,2,1)[30.357,9.643,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,171)[(12,6,0,'Grm',5.843,0,0),(6,2,1,'Grm',5.843,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step354_Que1_Req171.html

    Time of processing all requests 2557.401, Time of current queue's turn 57.401
    Step 355Processing queue 1request 172from Node7 (7)to Node1 (1) Remain 5.815 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 5.815 Gbps, to route the capacity requirement from Node7 to Node1
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 5.815 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 29.927 10.073 1
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 36.25 3.75 2
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 34.241 5.759 2
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 35.026 4.974 2
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 39.276 0.724 3
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 38.503 1.497 3
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 28.471 11.529 3
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 30.357 9.643 2
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 15.398 24.602 2
    13 0 1 6.644 33.356 1
  • Getting VL with max free capacity among VLs with common source destination {(3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 4, 1): [7.212]}
  • List of VL ids with common source destination [(10, 4, 0), (10, 4, 1)]
    sdifreecapequal free capacities
    10 4 0 6.59
    10 4 1 7.212
  • Getting VL with max free capacity among VLs with common source destination {(3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649]}
  • List of VL ids with common source destination [(3, 10, 0), (3, 10, 1)]
    sdifreecapequal free capacities
    3 10 0 7.47
    3 10 1 6.649
  • Getting VL with max free capacity among VLs with common source destination {(3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (7, 1, 0): [10.073], (13, 11, 0): [11.259], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    3 1 9 8 11 7 10
    13 1 12 11 9 2 10 7 0
    4 13 2 3 8 9 12
    10 4 12 9 8 1
    0 9 6 10 11 4 13 5
    5 11 2 8 12 3 9 6
    7 3 1 8 11 9 2
    8 7 12 3 6 5
    6 7 9 2 13 3 12
    2 7 3 11 5 12
    11 7 12
    9 3 11 5 0 2 10 12
    1 13 10 5
    12 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    3 1 0 5.821
    13 1 0 5.866
    4 13 0 6.216
    10 4 0 6.59
    0 9 0 6.691
    3 9 0 7.035
    5 11 0 7.114
    3 8 0 7.118
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    7 1 0 10.073
    13 11 0 11.259
    8 12 0 12.188
    4 2 0 12.755
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    2 11 0 5.903
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    0 10 0 7.152
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    3 11 0 8.848
    7 8 0 6.131
    9 0 0 6.026
    0 11 0 11.529
    2 5 0 9.262
    1 13 0 6.708
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    7 11 1 5.985
    12 3 1 7.101
    8 6 1 7.358
    10 8 1 7.521
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 9.643
    4 12 1 16.094
    6 13 1 7.682
    6 3 1 17.053
    3 10 1 6.649
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    8 5 1 15.247
    5 6 1 24.602
    13 0 1 33.356
  • [Finding shortest path with minimum hops] Input graph: {3: [1, 9, 8, 11, 7, 10], 13: [1, 12, 11, 9, 2, 10, 7, 0], 4: [13, 2, 3, 8, 9, 12], 10: [4, 12, 9, 8, 1], 0: [9, 6, 10, 11, 4, 13, 5], 5: [11, 2, 8, 12, 3, 9, 6], 7: [3, 1, 8, 11, 9, 2], 8: [7, 12, 3, 6, 5], 6: [7, 9, 2, 13, 3, 12], 2: [7, 3, 11, 5, 12], 11: [7, 12], 9: [3, 11, 5, 0, 2, 10, 12], 1: [13, 10, 5], 12: [3]}
  • Source: 7
  • Destination: 1
  • All paths [7, 1] .
  • Processing path [7, 1]
  • Path2links [[7, 1]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[7, 1]]
  • Subtract the utilised capacity from the Link's [7, 1] free capacity.
  • Update value is -5.815
  • Updated Virtual Link's (7,1,0) free capacity to 4.258.
  • que 1 req 172 (src 7 dst 1 num 0) type Grm capacity 5.815 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 172 VirtualLinkID: 0 (src: 7 dst: 1 ), Required Capacity: 5.815 Free Capacity (on the graph): 4.258 Free Capacity (on the corresponding array:) 4.258 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(7,1,0)[(0,33,29.927,'New'),(1,172,5.815,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,1,0)[35.742,4.258,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,172)[(7,1,0,'Grm',5.815,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step355_Que1_Req172.html

    Time of processing all requests 2572.741, Time of current queue's turn 72.741
    Step 356Processing queue 1request 173from Node5 (5)to Node0 (0) Remain 5.756 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 5.756 Gbps, to route the capacity requirement from Node5 to Node0
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 5.756 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 35.742 4.258 2
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 36.25 3.75 2
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 34.241 5.759 2
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 35.026 4.974 2
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 39.276 0.724 3
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 33.974 6.026 2
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 38.503 1.497 3
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 28.471 11.529 3
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 27.551 12.449 1
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 30.357 9.643 2
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 15.398 24.602 2
    13 0 1 6.644 33.356 1
  • Getting VL with max free capacity among VLs with common source destination {(1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 4, 1): [7.212]}
  • List of VL ids with common source destination [(10, 4, 0), (10, 4, 1)]
    sdifreecapequal free capacities
    10 4 0 6.59
    10 4 1 7.212
  • Getting VL with max free capacity among VLs with common source destination {(1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649]}
  • List of VL ids with common source destination [(3, 10, 0), (3, 10, 1)]
    sdifreecapequal free capacities
    3 10 0 7.47
    3 10 1 6.649
  • Getting VL with max free capacity among VLs with common source destination {(1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (9, 0, 0): [6.026], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [12.449], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    1 6 13 10 5
    3 1 9 8 11 7 10
    13 1 12 11 9 2 10 7 0
    4 13 2 3 8 9 12
    10 4 12 9 8 1
    0 9 6 10 11 4 13 5
    5 11 2 8 12 3 9 6
    7 3 8 11 9 2
    8 7 2 12 3 6 5
    6 7 9 2 13 3 12
    2 7 3 11 5 12
    11 7 12
    9 3 11 5 0 2 10 12
    12 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    1 6 0 5.758
    3 1 0 5.821
    13 1 0 5.866
    4 13 0 6.216
    10 4 0 6.59
    0 9 0 6.691
    3 9 0 7.035
    5 11 0 7.114
    3 8 0 7.118
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    13 11 0 11.259
    8 2 0 5.759
    8 12 0 12.188
    4 2 0 12.755
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    2 11 0 5.903
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    0 10 0 7.152
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    3 11 0 8.848
    7 8 0 6.131
    9 0 0 6.026
    0 11 0 11.529
    2 5 0 9.262
    1 13 0 6.708
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    7 11 1 5.985
    12 3 1 7.101
    8 6 1 7.358
    10 8 1 7.521
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 12.449
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 9.643
    4 12 1 16.094
    6 13 1 7.682
    6 3 1 17.053
    3 10 1 6.649
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    8 5 1 15.247
    5 6 1 24.602
    13 0 1 33.356
  • [Finding shortest path with minimum hops] Input graph: {1: [6, 13, 10, 5], 3: [1, 9, 8, 11, 7, 10], 13: [1, 12, 11, 9, 2, 10, 7, 0], 4: [13, 2, 3, 8, 9, 12], 10: [4, 12, 9, 8, 1], 0: [9, 6, 10, 11, 4, 13, 5], 5: [11, 2, 8, 12, 3, 9, 6], 7: [3, 8, 11, 9, 2], 8: [7, 2, 12, 3, 6, 5], 6: [7, 9, 2, 13, 3, 12], 2: [7, 3, 11, 5, 12], 11: [7, 12], 9: [3, 11, 5, 0, 2, 10, 12], 12: [3]}
  • Source: 5
  • Destination: 0
  • All paths [5, 9, 0] .
  • Processing path [5, 9, 0]
  • Path2links [[5, 9], [9, 0]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[5, 9], [9, 0]]
  • Subtract the utilised capacity from the Link's [5, 9] free capacity.
  • Update value is -5.756
  • Updated Virtual Link's (5,9,1) free capacity to 6.693.
  • que 1 req 173 (src 5 dst 9 num 1) type Grm capacity 5.756 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 173 VirtualLinkID: 138 (src: 5 dst: 9 ), Required Capacity: 5.756 Free Capacity (on the graph): 6.693 Free Capacity (on the corresponding array:) -5.047 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [9, 0] free capacity.
  • Update value is -5.756
  • Updated Virtual Link's (9,0,0) free capacity to 0.270.
  • que 1 req 173 (src 9 dst 0 num 0) type Grm capacity 5.756 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 173 VirtualLinkID: 134 (src: 9 dst: 0 ), Required Capacity: 5.756 Free Capacity (on the graph): 0.27 Free Capacity (on the corresponding array:) 0.27 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(5,9,1)[(1,40,27.551,'New'),(1,173,5.756,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,9,1)[33.307,6.693,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,173)[(5,9,1,'Grm',5.756,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(9,0,0)[(0,133,15.179,'New'),(1,103,18.795,'Grm'),(1,173,5.756,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,0,0)[39.730,0.270,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,173)[(5,9,1,'Grm',5.756,0,0),(9,0,0,'Grm',5.756,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step356_Que1_Req173.html

    Time of processing all requests 2585.068, Time of current queue's turn 85.068
    Step 357Processing queue 1request 174from Node3 (3)to Node12 (12) Remain 5.731 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 5.731 Gbps, to route the capacity requirement from Node3 to Node12
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 5.731 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 32.965 7.035 1
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 35.742 4.258 2
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 36.25 3.75 2
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 34.241 5.759 2
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 35.026 4.974 2
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 39.276 0.724 3
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 39.73 0.27 3
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 38.503 1.497 3
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 28.471 11.529 3
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 33.307 6.693 2
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 26.131 13.869 1
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 30.357 9.643 2
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 15.398 24.602 2
    13 0 1 6.644 33.356 1
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 4, 1): [7.212]}
  • List of VL ids with common source destination [(10, 4, 0), (10, 4, 1)]
    sdifreecapequal free capacities
    10 4 0 6.59
    10 4 1 7.212
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649]}
  • List of VL ids with common source destination [(3, 10, 0), (3, 10, 1)]
    sdifreecapequal free capacities
    3 10 0 7.47
    3 10 1 6.649
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (3, 9, 0): [7.035], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (1, 5, 0): [10.804], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [13.869], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    1 2 6 13 10 5
    3 1 9 8 11 7 10
    13 1 12 11 9 2 10 7 0
    4 13 2 3 8 9 12
    10 4 12 9 8 1
    0 9 6 10 11 4 13 5
    5 11 2 8 12 3 9 6
    7 3 8 11 9 2
    8 7 2 12 3 6 5
    6 7 9 2 13 3 12
    2 7 3 11 5 12
    11 7 12
    9 3 11 5 2 10 12
    12 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    1 2 0 5.747
    1 6 0 5.758
    3 1 0 5.821
    13 1 0 5.866
    4 13 0 6.216
    10 4 0 6.59
    0 9 0 6.691
    3 9 0 7.035
    5 11 0 7.114
    3 8 0 7.118
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    13 11 0 11.259
    8 2 0 5.759
    8 12 0 12.188
    4 2 0 12.755
    13 9 0 13.833
    13 2 0 14.463
    2 3 0 16.363
    2 11 0 5.903
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    0 10 0 7.152
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    3 11 0 8.848
    7 8 0 6.131
    0 11 0 11.529
    2 5 0 9.262
    1 13 0 6.708
    1 10 0 11.063
    3 7 0 10.663
    1 5 0 10.804
    7 11 1 5.985
    12 3 1 7.101
    8 6 1 7.358
    10 8 1 7.521
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 6.693
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 13.869
    11 12 1 15.105
    6 2 1 9.643
    4 12 1 16.094
    6 13 1 7.682
    6 3 1 17.053
    3 10 1 6.649
    0 5 1 20.503
    6 12 1 22.64
    13 7 1 25.849
    8 5 1 15.247
    5 6 1 24.602
    13 0 1 33.356
  • [Finding shortest path with minimum hops] Input graph: {1: [2, 6, 13, 10, 5], 3: [1, 9, 8, 11, 7, 10], 13: [1, 12, 11, 9, 2, 10, 7, 0], 4: [13, 2, 3, 8, 9, 12], 10: [4, 12, 9, 8, 1], 0: [9, 6, 10, 11, 4, 13, 5], 5: [11, 2, 8, 12, 3, 9, 6], 7: [3, 8, 11, 9, 2], 8: [7, 2, 12, 3, 6, 5], 6: [7, 9, 2, 13, 3, 12], 2: [7, 3, 11, 5, 12], 11: [7, 12], 9: [3, 11, 5, 2, 10, 12], 12: [3]}
  • Source: 3
  • Destination: 12
  • All paths [3, 9, 12] .
  • Processing path [3, 9, 12]
  • Path2links [[3, 9], [9, 12]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[3, 9], [9, 12]]
  • Subtract the utilised capacity from the Link's [3, 9] free capacity.
  • Update value is -5.731
  • Updated Virtual Link's (3,9,0) free capacity to 1.304.
  • que 1 req 174 (src 3 dst 9 num 0) type Grm capacity 5.731 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 174 VirtualLinkID: 80 (src: 3 dst: 9 ), Required Capacity: 5.731 Free Capacity (on the graph): 1.304 Free Capacity (on the corresponding array:) -22.93 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [9, 12] free capacity.
  • Update value is -5.731
  • Updated Virtual Link's (9,12,1) free capacity to 8.138.
  • que 1 req 174 (src 9 dst 12 num 1) type Grm capacity 5.731 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 174 VirtualLinkID: 129 (src: 9 dst: 12 ), Required Capacity: 5.731 Free Capacity (on the graph): 8.138 Free Capacity (on the corresponding array:) -4.763 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,9,0)[(0,11,32.965,'New'),(1,174,5.731,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,9,0)[38.696,1.304,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,174)[(3,9,0,'Grm',5.731,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(9,12,1)[(1,50,26.131,'New'),(1,174,5.731,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(9,12,1)[31.862,8.138,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,174)[(3,9,0,'Grm',5.731,0,0),(9,12,1,'Grm',5.731,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step357_Que1_Req174.html

    Time of processing all requests 2609.890, Time of current queue's turn 9.890
    Step 358Processing queue 1request 175from Node3 (3)to Node11 (11) Remain 5.59 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 5.59 Gbps, to route the capacity requirement from Node3 to Node11
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 5.59 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 38.696 1.304 2
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 35.742 4.258 2
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 36.25 3.75 2
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 34.241 5.759 2
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 35.026 4.974 2
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 31.152 8.848 2
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 39.276 0.724 3
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 39.73 0.27 3
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 38.503 1.497 3
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 28.471 11.529 3
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 33.307 6.693 2
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 31.862 8.138 2
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 30.357 9.643 2
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 15.398 24.602 2
    13 0 1 6.644 33.356 1
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704]}
  • List of VL ids with common source destination [(13, 9, 0), (13, 9, 1)]
    sdifreecapequal free capacities
    13 9 0 13.833
    13 9 1 5.704
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 4, 1): [7.212]}
  • List of VL ids with common source destination [(10, 4, 0), (10, 4, 1)]
    sdifreecapequal free capacities
    10 4 0 6.59
    10 4 1 7.212
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649]}
  • List of VL ids with common source destination [(3, 10, 0), (3, 10, 1)]
    sdifreecapequal free capacities
    3 10 0 7.47
    3 10 1 6.649
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • Getting VL with max free capacity among VLs with common source destination {(1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (3, 11, 0): [8.848], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 7, 1): [25.849]}
  • List of VL ids with common source destination [(13, 7, 0), (13, 7, 1)]
    sdifreecapequal free capacities
    13 7 0 5.708
    13 7 1 25.849
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    1 2 6 13 10 5
    3 1 8 11 7 10
    13 1 12 11 2 7 9 10 0
    4 13 2 3 8 9 12
    10 4 12 9 8 1
    0 9 6 10 11 4 13 5
    5 11 2 8 12 3 9 6
    7 3 8 11 9 2
    8 7 2 12 3 4 6 5
    6 7 9 2 13 3 12
    2 7 3 11 5 12
    11 7 12
    9 3 11 5 2 10 12
    12 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    1 2 0 5.747
    1 6 0 5.758
    3 1 0 5.821
    13 1 0 5.866
    4 13 0 6.216
    10 4 0 6.59
    0 9 0 6.691
    5 11 0 7.114
    3 8 0 7.118
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    13 11 0 11.259
    8 2 0 5.759
    8 12 0 12.188
    4 2 0 12.755
    13 2 0 14.463
    2 3 0 16.363
    2 11 0 5.903
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    0 10 0 7.152
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    3 11 0 8.848
    7 8 0 6.131
    0 11 0 11.529
    2 5 0 9.262
    1 13 0 6.708
    1 10 0 11.063
    3 7 0 10.663
    13 7 0 5.708
    1 5 0 10.804
    13 9 1 5.704
    8 4 1 5.709
    7 11 1 5.985
    12 3 1 7.101
    8 6 1 7.358
    10 8 1 7.521
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 6.693
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 8.138
    11 12 1 15.105
    6 2 1 9.643
    4 12 1 16.094
    6 13 1 7.682
    6 3 1 17.053
    3 10 1 6.649
    0 5 1 20.503
    6 12 1 22.64
    8 5 1 15.247
    5 6 1 24.602
    13 0 1 33.356
  • [Finding shortest path with minimum hops] Input graph: {1: [2, 6, 13, 10, 5], 3: [1, 8, 11, 7, 10], 13: [1, 12, 11, 2, 7, 9, 10, 0], 4: [13, 2, 3, 8, 9, 12], 10: [4, 12, 9, 8, 1], 0: [9, 6, 10, 11, 4, 13, 5], 5: [11, 2, 8, 12, 3, 9, 6], 7: [3, 8, 11, 9, 2], 8: [7, 2, 12, 3, 4, 6, 5], 6: [7, 9, 2, 13, 3, 12], 2: [7, 3, 11, 5, 12], 11: [7, 12], 9: [3, 11, 5, 2, 10, 12], 12: [3]}
  • Source: 3
  • Destination: 11
  • All paths [3, 11] .
  • Processing path [3, 11]
  • Path2links [[3, 11]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[3, 11]]
  • Subtract the utilised capacity from the Link's [3, 11] free capacity.
  • Update value is -5.59
  • Updated Virtual Link's (3,11,0) free capacity to 3.258.
  • que 1 req 175 (src 3 dst 11 num 0) type Grm capacity 5.590 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 175 VirtualLinkID: 121 (src: 3 dst: 11 ), Required Capacity: 5.59 Free Capacity (on the graph): 3.258 Free Capacity (on the corresponding array:) 3.258 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(3,11,0)[(0,120,17.014,'New'),(1,122,14.138,'Grm'),(1,175,5.590,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(3,11,0)[36.742,3.258,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,175)[(3,11,0,'Grm',5.590,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step358_Que1_Req175.html

    Time of processing all requests 2625.523, Time of current queue's turn 25.523
    Step 359Processing queue 1request 176from Node7 (7)to Node12 (12) Remain 5.434 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 5.434 Gbps, to route the capacity requirement from Node7 to Node12
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 5.434 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 38.696 1.304 2
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 35.742 4.258 2
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 36.25 3.75 2
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 34.241 5.759 2
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 27.812 12.188 1
    13 5 0 35.026 4.974 2
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 36.742 3.258 3
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 39.276 0.724 3
    7 8 0 33.869 6.131 2
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 39.73 0.27 3
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 38.503 1.497 3
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 28.471 11.529 3
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 33.307 6.693 2
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 31.862 8.138 2
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 30.357 9.643 2
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 15.398 24.602 2
    13 0 1 6.644 33.356 1
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704]}
  • List of VL ids with common source destination [(13, 9, 0), (13, 9, 1)]
    sdifreecapequal free capacities
    13 9 0 13.833
    13 9 1 5.704
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 4, 1): [7.212]}
  • List of VL ids with common source destination [(10, 4, 0), (10, 4, 1)]
    sdifreecapequal free capacities
    10 4 0 6.59
    10 4 1 7.212
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (7, 8, 0): [6.131], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649]}
  • List of VL ids with common source destination [(3, 10, 0), (3, 10, 1)]
    sdifreecapequal free capacities
    3 10 0 7.47
    3 10 1 6.649
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 7, 1): [25.849]}
  • List of VL ids with common source destination [(13, 7, 0), (13, 7, 1)]
    sdifreecapequal free capacities
    13 7 0 5.708
    13 7 1 25.849
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [12.188], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (7, 8, 0): [6.131], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (8, 5, 1): [15.247], (5, 6, 1): [24.602]}
  • List of VL ids with common source destination [(5, 6, 0), (5, 6, 1)]
    sdifreecapequal free capacities
    5 6 0 5.524
    5 6 1 24.602
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    8 9 7 2 12 3 4 6 5
    1 2 6 13 12 10 5
    3 1 8 7 10
    13 1 12 11 2 7 9 10 0
    4 13 2 3 8 9 12
    10 4 12 9 8 1
    0 9 6 10 11 4 13 5
    5 11 2 8 12 6 3 9
    7 3 8 11 9 2
    6 7 9 2 13 3 12
    2 7 3 11 5 12
    11 7 12
    9 3 11 5 2 10 12
    12 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    8 9 0 5.49
    1 2 0 5.747
    1 6 0 5.758
    3 1 0 5.821
    13 1 0 5.866
    4 13 0 6.216
    10 4 0 6.59
    0 9 0 6.691
    5 11 0 7.114
    3 8 0 7.118
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    13 11 0 11.259
    8 2 0 5.759
    8 12 0 12.188
    4 2 0 12.755
    13 2 0 14.463
    2 3 0 16.363
    2 11 0 5.903
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    0 10 0 7.152
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    5 6 0 5.524
    7 8 0 6.131
    0 11 0 11.529
    2 5 0 9.262
    1 13 0 6.708
    1 12 0 5.498
    1 10 0 11.063
    3 7 0 10.663
    13 7 0 5.708
    1 5 0 10.804
    13 9 1 5.704
    8 4 1 5.709
    7 11 1 5.985
    12 3 1 7.101
    8 6 1 7.358
    10 8 1 7.521
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 6.693
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 8.138
    11 12 1 15.105
    6 2 1 9.643
    4 12 1 16.094
    6 13 1 7.682
    6 3 1 17.053
    3 10 1 6.649
    0 5 1 20.503
    6 12 1 22.64
    8 5 1 15.247
    13 0 1 33.356
  • [Finding shortest path with minimum hops] Input graph: {8: [9, 7, 2, 12, 3, 4, 6, 5], 1: [2, 6, 13, 12, 10, 5], 3: [1, 8, 7, 10], 13: [1, 12, 11, 2, 7, 9, 10, 0], 4: [13, 2, 3, 8, 9, 12], 10: [4, 12, 9, 8, 1], 0: [9, 6, 10, 11, 4, 13, 5], 5: [11, 2, 8, 12, 6, 3, 9], 7: [3, 8, 11, 9, 2], 6: [7, 9, 2, 13, 3, 12], 2: [7, 3, 11, 5, 12], 11: [7, 12], 9: [3, 11, 5, 2, 10, 12], 12: [3]}
  • Source: 7
  • Destination: 12
  • All paths [7, 8, 12] .
  • Processing path [7, 8, 12]
  • Path2links [[7, 8], [8, 12]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[7, 8], [8, 12]]
  • Subtract the utilised capacity from the Link's [7, 8] free capacity.
  • Update value is -5.434
  • Updated Virtual Link's (7,8,0) free capacity to 0.697.
  • que 1 req 176 (src 7 dst 8 num 0) type Grm capacity 5.434 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 176 VirtualLinkID: 131 (src: 7 dst: 8 ), Required Capacity: 5.434 Free Capacity (on the graph): 0.697 Free Capacity (on the corresponding array:) 0.697 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [8, 12] free capacity.
  • Update value is -5.434
  • Updated Virtual Link's (8,12,0) free capacity to 6.754.
  • que 1 req 176 (src 8 dst 12 num 0) type Grm capacity 5.434 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 176 VirtualLinkID: 0 (src: 8 dst: 12 ), Required Capacity: 5.434 Free Capacity (on the graph): 6.754 Free Capacity (on the corresponding array:) 6.754 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(7,8,0)[(0,130,15.747,'New'),(1,105,18.122,'Grm'),(1,176,5.434,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(7,8,0)[39.303,0.697,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,176)[(7,8,0,'Grm',5.434,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,12,0)[(0,56,27.812,'New'),(1,176,5.434,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,12,0)[33.246,6.754,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,176)[(7,8,0,'Grm',5.434,0,0),(8,12,0,'Grm',5.434,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step359_Que1_Req176.html

    Time of processing all requests 2637.978, Time of current queue's turn 37.978
    Step 360Processing queue 1request 177from Node5 (5)to Node13 (13) Remain 5.425 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 5.425 Gbps, to route the capacity requirement from Node5 to Node13
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 5.425 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 38.696 1.304 2
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 35.742 4.258 2
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 36.25 3.75 2
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 34.241 5.759 2
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 33.246 6.754 2
    13 5 0 35.026 4.974 2
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 36.742 3.258 3
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 34.476 5.524 2
    9 12 0 39.032 0.968 2
    12 6 0 39.276 0.724 3
    7 8 0 39.303 0.697 3
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 39.73 0.27 3
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 38.503 1.497 3
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 28.471 11.529 3
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 33.307 6.693 2
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 31.862 8.138 2
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 30.357 9.643 2
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 32.318 7.682 2
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 15.398 24.602 2
    13 0 1 6.644 33.356 1
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704]}
  • List of VL ids with common source destination [(13, 9, 0), (13, 9, 1)]
    sdifreecapequal free capacities
    13 9 0 13.833
    13 9 1 5.704
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 4, 1): [7.212]}
  • List of VL ids with common source destination [(10, 4, 0), (10, 4, 1)]
    sdifreecapequal free capacities
    10 4 0 6.59
    10 4 1 7.212
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649]}
  • List of VL ids with common source destination [(3, 10, 0), (3, 10, 1)]
    sdifreecapequal free capacities
    3 10 0 7.47
    3 10 1 6.649
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 7, 1): [25.849]}
  • List of VL ids with common source destination [(13, 7, 0), (13, 7, 1)]
    sdifreecapequal free capacities
    13 7 0 5.708
    13 7 1 25.849
  • Getting VL with max free capacity among VLs with common source destination {(8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (5, 6, 0): [5.524], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 13, 1): [7.682], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (8, 5, 1): [15.247], (5, 6, 1): [24.602]}
  • List of VL ids with common source destination [(5, 6, 0), (5, 6, 1)]
    sdifreecapequal free capacities
    5 6 0 5.524
    5 6 1 24.602
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    8 9 7 2 12 3 4 6 5
    1 2 6 13 12 10 5
    3 1 8 7 10
    13 1 12 11 2 7 9 10 0
    4 13 2 3 8 9 12
    10 4 12 9 8 1
    0 9 6 10 11 4 13 5
    5 11 2 8 12 6 3 9
    7 3 11 9 2
    6 7 9 2 13 3 12
    2 7 3 11 5 12
    11 7 12
    9 3 11 5 2 10 12
    12 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    8 9 0 5.49
    1 2 0 5.747
    1 6 0 5.758
    3 1 0 5.821
    13 1 0 5.866
    4 13 0 6.216
    10 4 0 6.59
    0 9 0 6.691
    5 11 0 7.114
    3 8 0 7.118
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    13 11 0 11.259
    8 2 0 5.759
    8 12 0 6.754
    4 2 0 12.755
    13 2 0 14.463
    2 3 0 16.363
    2 11 0 5.903
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    0 10 0 7.152
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    5 6 0 5.524
    0 11 0 11.529
    2 5 0 9.262
    1 13 0 6.708
    1 12 0 5.498
    1 10 0 11.063
    3 7 0 10.663
    13 7 0 5.708
    1 5 0 10.804
    13 9 1 5.704
    8 4 1 5.709
    7 11 1 5.985
    12 3 1 7.101
    8 6 1 7.358
    10 8 1 7.521
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 6.693
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 8.138
    11 12 1 15.105
    6 2 1 9.643
    4 12 1 16.094
    6 13 1 7.682
    6 3 1 17.053
    3 10 1 6.649
    0 5 1 20.503
    6 12 1 22.64
    8 5 1 15.247
    13 0 1 33.356
  • [Finding shortest path with minimum hops] Input graph: {8: [9, 7, 2, 12, 3, 4, 6, 5], 1: [2, 6, 13, 12, 10, 5], 3: [1, 8, 7, 10], 13: [1, 12, 11, 2, 7, 9, 10, 0], 4: [13, 2, 3, 8, 9, 12], 10: [4, 12, 9, 8, 1], 0: [9, 6, 10, 11, 4, 13, 5], 5: [11, 2, 8, 12, 6, 3, 9], 7: [3, 11, 9, 2], 6: [7, 9, 2, 13, 3, 12], 2: [7, 3, 11, 5, 12], 11: [7, 12], 9: [3, 11, 5, 2, 10, 12], 12: [3]}
  • Source: 5
  • Destination: 13
  • All paths [5, 6, 13] .
  • Processing path [5, 6, 13]
  • Path2links [[5, 6], [6, 13]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[5, 6], [6, 13]]
  • Subtract the utilised capacity from the Link's [5, 6] free capacity.
  • Update value is -5.425
  • Updated Virtual Link's (5,6,0) free capacity to 0.099.
  • que 1 req 177 (src 5 dst 6 num 0) type Grm capacity 5.425 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 177 VirtualLinkID: 128 (src: 5 dst: 6 ), Required Capacity: 5.425 Free Capacity (on the graph): 0.099 Free Capacity (on the corresponding array:) -7.339 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [6, 13] free capacity.
  • Update value is -5.425
  • Updated Virtual Link's (6,13,1) free capacity to 2.257.
  • que 1 req 177 (src 6 dst 13 num 1) type Grm capacity 5.425 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 177 VirtualLinkID: 55 (src: 6 dst: 13 ), Required Capacity: 5.425 Free Capacity (on the graph): 2.257 Free Capacity (on the corresponding array:) -9.58 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(5,6,0)[(0,127,16.247,'New'),(1,104,18.229,'Grm'),(1,177,5.425,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(5,6,0)[39.901,0.099,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,177)[(5,6,0,'Grm',5.425,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(6,13,1)[(1,72,23.393,'New'),(1,155,8.925,'Grm'),(1,177,5.425,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(6,13,1)[37.743,2.257,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,177)[(5,6,0,'Grm',5.425,0,0),(6,13,1,'Grm',5.425,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step360_Que1_Req177.html

    Time of processing all requests 2663.166, Time of current queue's turn 63.166
    Step 361Processing queue 1request 178from Node4 (4)to Node6 (6) Remain 5.388 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 5.388 Gbps, to route the capacity requirement from Node4 to Node6
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 5.388 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 38.696 1.304 2
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 35.742 4.258 2
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 36.25 3.75 2
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 34.241 5.759 2
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 33.246 6.754 2
    13 5 0 35.026 4.974 2
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 36.742 3.258 3
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 39.901 0.099 3
    9 12 0 39.032 0.968 2
    12 6 0 39.276 0.724 3
    7 8 0 39.303 0.697 3
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 39.73 0.27 3
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 38.503 1.497 3
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 28.471 11.529 3
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 32.642 7.358 1
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 29.038 10.962 1
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 33.307 6.693 2
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 31.862 8.138 2
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 30.357 9.643 2
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 37.743 2.257 3
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 15.398 24.602 2
    13 0 1 6.644 33.356 1
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704]}
  • List of VL ids with common source destination [(13, 9, 0), (13, 9, 1)]
    sdifreecapequal free capacities
    13 9 0 13.833
    13 9 1 5.704
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 4, 1): [7.212]}
  • List of VL ids with common source destination [(10, 4, 0), (10, 4, 1)]
    sdifreecapequal free capacities
    10 4 0 6.59
    10 4 1 7.212
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 10.962
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (3, 10, 1): [6.649]}
  • List of VL ids with common source destination [(3, 10, 0), (3, 10, 1)]
    sdifreecapequal free capacities
    3 10 0 7.47
    3 10 1 6.649
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (8, 6, 1): [7.358], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [10.962], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 7, 1): [25.849]}
  • List of VL ids with common source destination [(13, 7, 0), (13, 7, 1)]
    sdifreecapequal free capacities
    13 7 0 5.708
    13 7 1 25.849
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    11 10 7 12
    8 9 7 2 12 3 10 4 6 5
    1 2 6 13 12 10 5
    3 1 8 7 10
    13 1 12 11 2 7 9 10 0
    4 13 2 3 8 9 12
    10 4 12 9 8 1
    0 9 6 10 11 4 13 5
    5 11 2 8 12 3 9 6
    7 3 11 9 2
    6 7 9 2 3 12
    2 7 3 11 5 12
    9 3 11 5 2 10 12
    12 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    11 10 0 5.423
    8 9 0 5.49
    1 2 0 5.747
    1 6 0 5.758
    3 1 0 5.821
    13 1 0 5.866
    4 13 0 6.216
    10 4 0 6.59
    0 9 0 6.691
    5 11 0 7.114
    3 8 0 7.118
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    13 11 0 11.259
    8 2 0 5.759
    8 12 0 6.754
    4 2 0 12.755
    13 2 0 14.463
    2 3 0 16.363
    2 11 0 5.903
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    0 10 0 7.152
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    0 11 0 11.529
    2 5 0 9.262
    1 13 0 6.708
    1 12 0 5.498
    1 10 0 11.063
    3 7 0 10.663
    13 7 0 5.708
    8 10 0 5.401
    1 5 0 10.804
    13 9 1 5.704
    8 4 1 5.709
    7 11 1 5.985
    12 3 1 7.101
    8 6 1 7.358
    10 8 1 7.521
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 10.962
    13 10 1 11.562
    5 9 1 6.693
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 8.138
    11 12 1 15.105
    6 2 1 9.643
    4 12 1 16.094
    6 3 1 17.053
    3 10 1 6.649
    0 5 1 20.503
    6 12 1 22.64
    8 5 1 15.247
    5 6 1 24.602
    13 0 1 33.356
  • [Finding shortest path with minimum hops] Input graph: {11: [10, 7, 12], 8: [9, 7, 2, 12, 3, 10, 4, 6, 5], 1: [2, 6, 13, 12, 10, 5], 3: [1, 8, 7, 10], 13: [1, 12, 11, 2, 7, 9, 10, 0], 4: [13, 2, 3, 8, 9, 12], 10: [4, 12, 9, 8, 1], 0: [9, 6, 10, 11, 4, 13, 5], 5: [11, 2, 8, 12, 3, 9, 6], 7: [3, 11, 9, 2], 6: [7, 9, 2, 3, 12], 2: [7, 3, 11, 5, 12], 9: [3, 11, 5, 2, 10, 12], 12: [3]}
  • Source: 4
  • Destination: 6
  • All paths [4, 8, 6] .
  • Processing path [4, 8, 6]
  • Path2links [[4, 8], [8, 6]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[4, 8], [8, 6]]
  • Subtract the utilised capacity from the Link's [4, 8] free capacity.
  • Update value is -5.388
  • Updated Virtual Link's (4,8,1) free capacity to 5.574.
  • que 1 req 178 (src 4 dst 8 num 1) type Grm capacity 5.388 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 178 VirtualLinkID: 147 (src: 4 dst: 8 ), Required Capacity: 5.388 Free Capacity (on the graph): 5.574 Free Capacity (on the corresponding array:) 5.888 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [8, 6] free capacity.
  • Update value is -5.388
  • Updated Virtual Link's (8,6,1) free capacity to 1.970.
  • que 1 req 178 (src 8 dst 6 num 1) type Grm capacity 5.388 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 178 VirtualLinkID: 162 (src: 8 dst: 6 ), Required Capacity: 5.388 Free Capacity (on the graph): 1.97 Free Capacity (on the corresponding array:) -2.215 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(4,8,1)[(1,30,29.038,'New'),(1,178,5.388,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,8,1)[34.426,5.574,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,178)[(4,8,1,'Grm',5.388,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(8,6,1)[(1,7,32.642,'New'),(1,178,5.388,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(8,6,1)[38.030,1.970,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,178)[(4,8,1,'Grm',5.388,0,0),(8,6,1,'Grm',5.388,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step361_Que1_Req178.html

    Time of processing all requests 2678.814, Time of current queue's turn 78.814
    Step 362Processing queue 1request 179from Node0 (0)to Node8 (8) Remain 5.367 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 5.367 Gbps, to route the capacity requirement from Node0 to Node8
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 5.367 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 38.696 1.304 2
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 35.742 4.258 2
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 36.25 3.75 2
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 34.241 5.759 2
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 33.246 6.754 2
    13 5 0 35.026 4.974 2
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 32.848 7.152 2
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 36.742 3.258 3
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 39.901 0.099 3
    9 12 0 39.032 0.968 2
    12 6 0 39.276 0.724 3
    7 8 0 39.303 0.697 3
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 39.73 0.27 3
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 38.503 1.497 3
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 28.471 11.529 3
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 38.03 1.97 2
    10 8 1 32.479 7.521 1
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 34.426 5.574 2
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 33.307 6.693 2
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 31.862 8.138 2
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 30.357 9.643 2
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 37.743 2.257 3
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 15.398 24.602 2
    13 0 1 6.644 33.356 1
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704]}
  • List of VL ids with common source destination [(13, 9, 0), (13, 9, 1)]
    sdifreecapequal free capacities
    13 9 0 13.833
    13 9 1 5.704
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 4, 1): [7.212]}
  • List of VL ids with common source destination [(10, 4, 0), (10, 4, 1)]
    sdifreecapequal free capacities
    10 4 0 6.59
    10 4 1 7.212
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 8, 1): [7.521], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 5.574
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (3, 10, 1): [6.649]}
  • List of VL ids with common source destination [(3, 10, 0), (3, 10, 1)]
    sdifreecapequal free capacities
    3 10 0 7.47
    3 10 1 6.649
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (0, 10, 0): [7.152], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 8, 1): [7.521], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 7, 1): [25.849]}
  • List of VL ids with common source destination [(13, 7, 0), (13, 7, 1)]
    sdifreecapequal free capacities
    13 7 0 5.708
    13 7 1 25.849
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    11 10 7 12
    8 9 7 2 12 3 10 4 5
    1 2 6 13 12 10 5
    3 1 8 7 10
    13 1 12 11 2 7 9 10 0
    4 13 2 3 8 9 12
    10 4 12 9 8 1
    0 9 6 10 11 4 13 5
    5 11 2 8 12 3 9 6
    7 3 11 9 2
    6 7 9 2 3 12
    2 7 3 11 5 12
    9 3 11 5 2 10 12
    12 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    11 10 0 5.423
    8 9 0 5.49
    1 2 0 5.747
    1 6 0 5.758
    3 1 0 5.821
    13 1 0 5.866
    4 13 0 6.216
    10 4 0 6.59
    0 9 0 6.691
    5 11 0 7.114
    3 8 0 7.118
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    13 11 0 11.259
    8 2 0 5.759
    8 12 0 6.754
    4 2 0 12.755
    13 2 0 14.463
    2 3 0 16.363
    2 11 0 5.903
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    0 10 0 7.152
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    0 11 0 11.529
    2 5 0 9.262
    1 13 0 6.708
    1 12 0 5.498
    1 10 0 11.063
    3 7 0 10.663
    13 7 0 5.708
    8 10 0 5.401
    1 5 0 10.804
    13 9 1 5.704
    8 4 1 5.709
    7 11 1 5.985
    12 3 1 7.101
    10 8 1 7.521
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 5.574
    13 10 1 11.562
    5 9 1 6.693
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 8.138
    11 12 1 15.105
    6 2 1 9.643
    4 12 1 16.094
    6 3 1 17.053
    3 10 1 6.649
    0 5 1 20.503
    6 12 1 22.64
    8 5 1 15.247
    5 6 1 24.602
    13 0 1 33.356
  • [Finding shortest path with minimum hops] Input graph: {11: [10, 7, 12], 8: [9, 7, 2, 12, 3, 10, 4, 5], 1: [2, 6, 13, 12, 10, 5], 3: [1, 8, 7, 10], 13: [1, 12, 11, 2, 7, 9, 10, 0], 4: [13, 2, 3, 8, 9, 12], 10: [4, 12, 9, 8, 1], 0: [9, 6, 10, 11, 4, 13, 5], 5: [11, 2, 8, 12, 3, 9, 6], 7: [3, 11, 9, 2], 6: [7, 9, 2, 3, 12], 2: [7, 3, 11, 5, 12], 9: [3, 11, 5, 2, 10, 12], 12: [3]}
  • Source: 0
  • Destination: 8
  • All paths [0, 10, 8] .
  • Processing path [0, 10, 8]
  • Path2links [[0, 10], [10, 8]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[0, 10], [10, 8]]
  • Subtract the utilised capacity from the Link's [0, 10] free capacity.
  • Update value is -5.367
  • Updated Virtual Link's (0,10,0) free capacity to 1.785.
  • que 1 req 179 (src 0 dst 10 num 0) type Grm capacity 5.367 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 179 VirtualLinkID: 101 (src: 0 dst: 10 ), Required Capacity: 5.367 Free Capacity (on the graph): 1.785 Free Capacity (on the corresponding array:) 1.785 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [10, 8] free capacity.
  • Update value is -5.367
  • Updated Virtual Link's (10,8,1) free capacity to 2.154.
  • que 1 req 179 (src 10 dst 8 num 1) type Grm capacity 5.367 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 179 VirtualLinkID: 9 (src: 10 dst: 8 ), Required Capacity: 5.367 Free Capacity (on the graph): 2.154 Free Capacity (on the corresponding array:) -3.779 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(0,10,0)[(0,100,21.126,'New'),(1,135,11.722,'Grm'),(1,179,5.367,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(0,10,0)[38.215,1.785,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,179)[(0,10,0,'Grm',5.367,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(10,8,1)[(1,8,32.479,'New'),(1,179,5.367,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(10,8,1)[37.846,2.154,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,179)[(0,10,0,'Grm',5.367,0,0),(10,8,1,'Grm',5.367,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step362_Que1_Req179.html

    Time of processing all requests 2694.990, Time of current queue's turn 94.990
    Step 363Processing queue 1request 180from Node1 (1)to Node11 (11) Remain 5.355 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 5.355 Gbps, to route the capacity requirement from Node1 to Node11
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 5.355 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 34.253 5.747 1
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 38.696 1.304 2
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 35.742 4.258 2
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 36.25 3.75 2
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 34.241 5.759 2
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 33.246 6.754 2
    13 5 0 35.026 4.974 2
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 34.097 5.903 2
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 38.215 1.785 3
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 36.742 3.258 3
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 39.901 0.099 3
    9 12 0 39.032 0.968 2
    12 6 0 39.276 0.724 3
    7 8 0 39.303 0.697 3
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 39.73 0.27 3
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 38.503 1.497 3
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 28.471 11.529 3
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 38.03 1.97 2
    10 8 1 37.846 2.154 2
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 34.426 5.574 2
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 33.307 6.693 2
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 31.862 8.138 2
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 30.357 9.643 2
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 37.743 2.257 3
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 15.398 24.602 2
    13 0 1 6.644 33.356 1
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704]}
  • List of VL ids with common source destination [(13, 9, 0), (13, 9, 1)]
    sdifreecapequal free capacities
    13 9 0 13.833
    13 9 1 5.704
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 4, 1): [7.212]}
  • List of VL ids with common source destination [(10, 4, 0), (10, 4, 1)]
    sdifreecapequal free capacities
    10 4 0 6.59
    10 4 1 7.212
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 5.574
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (3, 10, 1): [6.649]}
  • List of VL ids with common source destination [(3, 10, 0), (3, 10, 1)]
    sdifreecapequal free capacities
    3 10 0 7.47
    3 10 1 6.649
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • Getting VL with max free capacity among VLs with common source destination {(11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 2, 0): [5.747], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (2, 11, 0): [5.903], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 7, 1): [25.849]}
  • List of VL ids with common source destination [(13, 7, 0), (13, 7, 1)]
    sdifreecapequal free capacities
    13 7 0 5.708
    13 7 1 25.849
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    11 10 7 12
    8 9 7 2 12 3 10 4 5
    1 2 6 13 12 10 5
    3 1 8 7 10
    13 1 12 11 2 7 9 10 0
    4 13 2 3 8 9 12
    10 4 12 9 1
    0 9 6 11 4 13 5
    5 11 2 8 12 3 9 6
    7 3 11 9 2
    6 7 9 2 3 12
    2 7 3 11 5 12
    9 3 11 5 2 10 12
    12 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    11 10 0 5.423
    8 9 0 5.49
    1 2 0 5.747
    1 6 0 5.758
    3 1 0 5.821
    13 1 0 5.866
    4 13 0 6.216
    10 4 0 6.59
    0 9 0 6.691
    5 11 0 7.114
    3 8 0 7.118
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    13 11 0 11.259
    8 2 0 5.759
    8 12 0 6.754
    4 2 0 12.755
    13 2 0 14.463
    2 3 0 16.363
    2 11 0 5.903
    5 12 0 16.887
    9 3 0 18.188
    0 6 0 18.526
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    0 11 0 11.529
    2 5 0 9.262
    1 13 0 6.708
    1 12 0 5.498
    1 10 0 11.063
    3 7 0 10.663
    13 7 0 5.708
    8 10 0 5.401
    1 5 0 10.804
    13 9 1 5.704
    8 4 1 5.709
    7 11 1 5.985
    12 3 1 7.101
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 5.574
    13 10 1 11.562
    5 9 1 6.693
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 8.138
    11 12 1 15.105
    6 2 1 9.643
    4 12 1 16.094
    6 3 1 17.053
    3 10 1 6.649
    0 5 1 20.503
    6 12 1 22.64
    8 5 1 15.247
    5 6 1 24.602
    13 0 1 33.356
  • [Finding shortest path with minimum hops] Input graph: {11: [10, 7, 12], 8: [9, 7, 2, 12, 3, 10, 4, 5], 1: [2, 6, 13, 12, 10, 5], 3: [1, 8, 7, 10], 13: [1, 12, 11, 2, 7, 9, 10, 0], 4: [13, 2, 3, 8, 9, 12], 10: [4, 12, 9, 1], 0: [9, 6, 11, 4, 13, 5], 5: [11, 2, 8, 12, 3, 9, 6], 7: [3, 11, 9, 2], 6: [7, 9, 2, 3, 12], 2: [7, 3, 11, 5, 12], 9: [3, 11, 5, 2, 10, 12], 12: [3]}
  • Source: 1
  • Destination: 11
  • All paths [1, 2, 11] .
  • Processing path [1, 2, 11]
  • Path2links [[1, 2], [2, 11]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[1, 2], [2, 11]]
  • Subtract the utilised capacity from the Link's [1, 2] free capacity.
  • Update value is -5.355
  • Updated Virtual Link's (1,2,0) free capacity to 0.392.
  • que 1 req 180 (src 1 dst 2 num 0) type Grm capacity 5.355 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 180 VirtualLinkID: 65 (src: 1 dst: 2 ), Required Capacity: 5.355 Free Capacity (on the graph): 0.392 Free Capacity (on the corresponding array:) -17.837 Grooming: Yes (value==1).
  • Subtract the utilised capacity from the Link's [2, 11] free capacity.
  • Update value is -5.355
  • Updated Virtual Link's (2,11,0) free capacity to 0.548.
  • que 1 req 180 (src 2 dst 11 num 0) type Grm capacity 5.355 step of routing reqquested traffic 0 step's virtual link sequence number 1
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 180 VirtualLinkID: 88 (src: 2 dst: 11 ), Required Capacity: 5.355 Free Capacity (on the graph): 0.548 Free Capacity (on the corresponding array:) -15.107 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(1,2,0)[(0,4,34.253,'New'),(1,180,5.355,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(1,2,0)[39.608,0.392,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,180)[(1,2,0,'Grm',5.355,0,0)]
    Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(2,11,0)[(0,87,23.368,'New'),(1,142,10.729,'Grm'),(1,180,5.355,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(2,11,0)[39.452,0.548,3]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,180)[(1,2,0,'Grm',5.355,0,0),(2,11,0,'Grm',5.355,0,1)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step363_Que1_Req180.html

    Time of processing all requests 2710.857, Time of current queue's turn 10.857
    Step 364Processing queue 1request 181from Node4 (4)to Node2 (2) Remain 5.114 Gbps to be routed.
  • Since the requirement is < 40 Gbps then an attempt to route traffic over existing virtual links will be made
  • Looking for 5.114 Gbps, to route the capacity requirement from Node4 to Node2
  • The virtual topology is NOT empty, hence looking for free capacity to groom.
  • Current virtual topology {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]} .
  • Required capacity 5.114 .
  • Current list of virtual links to create a virtual topology of adequate capacity.
    virtual link id utilised capacity free capacity number of traffic requests it servs
    source (s) destination (d) number of virtual link for (s,d)
    13 10 0 34.927 5.073 1
    11 2 0 34.692 5.308 1
    11 10 0 34.577 5.423 1
    8 9 0 34.51 5.49 1
    1 2 0 39.608 0.392 2
    1 6 0 34.242 5.758 1
    3 1 0 34.179 5.821 1
    13 1 0 34.134 5.866 1
    4 13 0 33.784 6.216 1
    10 4 0 33.41 6.59 1
    0 9 0 33.309 6.691 1
    3 9 0 38.696 1.304 2
    5 11 0 32.886 7.114 1
    3 8 0 32.882 7.118 1
    3 10 0 32.53 7.47 1
    7 3 0 32.28 7.72 1
    12 8 0 39.897 0.103 2
    8 7 0 32.057 7.943 1
    11 13 0 39.741 0.259 2
    6 7 0 31.776 8.224 1
    5 1 0 39.389 0.611 2
    6 9 0 31.724 8.276 1
    10 12 0 31.202 8.798 1
    5 2 0 31.194 8.806 1
    2 7 0 30.975 9.025 1
    10 9 0 30.641 9.359 1
    1 4 0 39.633 0.367 2
    11 4 0 39.246 0.754 2
    13 12 0 30.433 9.567 1
    5 8 0 30.251 9.749 1
    11 1 0 39.832 0.168 2
    11 7 0 30.07 9.93 1
    9 4 0 38.993 1.007 2
    7 1 0 35.742 4.258 2
    5 7 0 38.008 1.992 2
    6 10 0 37.705 2.295 2
    3 5 0 39.693 0.307 2
    2 4 0 39.729 0.271 2
    4 11 0 39.084 0.916 2
    7 9 0 39.163 0.837 2
    0 1 0 37.88 2.12 2
    0 8 0 37.721 2.279 2
    13 3 0 36.25 3.75 2
    13 4 0 37.75 2.25 2
    13 11 0 28.741 11.259 1
    13 0 0 36.698 3.302 2
    8 11 0 38.451 1.549 2
    4 3 0 38.723 1.277 2
    7 12 0 36.328 3.672 2
    12 9 0 39.694 0.306 2
    8 2 0 34.241 5.759 2
    4 7 0 37.698 2.302 2
    12 13 0 39.849 0.151 2
    1 7 0 36.991 3.009 2
    9 7 0 39.433 0.567 2
    1 0 0 39.428 0.572 2
    8 12 0 33.246 6.754 2
    13 5 0 35.026 4.974 2
    11 6 0 38.181 1.819 2
    5 3 0 38.109 1.891 2
    4 2 0 27.245 12.755 1
    7 6 0 38.358 1.642 2
    10 0 0 39.879 0.121 2
    2 12 0 26.956 13.044 1
    4 9 0 26.748 13.252 1
    13 9 0 26.167 13.833 1
    2 6 0 39.76 0.24 2
    5 13 0 39.629 0.371 2
    6 4 0 39.207 0.793 2
    13 2 0 25.537 14.463 1
    8 5 0 39.17 0.83 2
    12 0 0 39.489 0.511 2
    0 7 0 39.881 0.119 2
    13 8 0 39.136 0.864 2
    13 6 0 38.587 1.413 2
    10 8 0 38.412 1.588 2
    10 2 0 35.259 4.741 2
    0 13 0 38.632 1.368 2
    3 12 0 36.195 3.805 2
    4 6 0 39.988 0.012 2
    10 13 0 37.65 2.35 2
    6 13 0 35.23 4.77 2
    6 3 0 37.966 2.034 2
    10 11 0 39.598 0.402 2
    2 3 0 23.637 16.363 1
    12 10 0 39.357 0.643 2
    11 12 0 23.372 16.628 1
    2 11 0 39.452 0.548 3
    5 12 0 23.113 16.887 1
    4 10 0 36.655 3.345 2
    11 5 0 37.109 2.891 2
    12 3 0 35.076 4.924 2
    6 8 0 37.624 2.376 2
    8 4 0 36.533 3.467 2
    9 3 0 21.812 18.188 1
    3 13 0 37.488 2.512 2
    0 6 0 21.474 18.526 1
    7 2 0 21.425 18.575 1
    2 13 0 38.804 1.196 2
    7 5 0 35.16 4.84 2
    0 10 0 38.215 1.785 3
    5 10 0 37.586 2.414 2
    5 0 0 36.731 3.269 2
    3 4 0 36.345 3.655 2
    9 10 0 20.662 19.338 1
    4 5 0 36.325 3.675 2
    1 11 0 36.984 3.016 2
    2 9 0 39.35 0.65 2
    12 4 0 35.785 4.215 2
    4 12 0 37.698 2.302 2
    8 3 0 31.647 8.353 2
    9 11 0 32.526 7.474 2
    6 1 0 37.136 2.864 2
    12 2 0 39.496 0.504 2
    10 7 0 38.869 1.131 2
    2 1 0 38.932 1.068 2
    6 12 0 38.599 1.401 2
    10 3 0 39.515 0.485 2
    0 4 0 37.197 2.803 2
    9 5 0 31.757 8.243 2
    3 11 0 36.742 3.258 3
    3 0 0 36.23 3.77 2
    7 11 0 35.857 4.143 3
    11 0 0 36.069 3.931 2
    6 2 0 38.795 1.205 2
    12 1 0 39.6 0.4 2
    6 5 0 38.743 1.257 2
    5 6 0 39.901 0.099 3
    9 12 0 39.032 0.968 2
    12 6 0 39.276 0.724 3
    7 8 0 39.303 0.697 3
    10 6 0 37.728 2.272 2
    8 1 0 37.779 2.221 2
    9 0 0 39.73 0.27 3
    10 1 0 39.224 0.776 2
    7 10 0 36.586 3.414 2
    9 1 0 39.321 0.679 2
    5 9 0 39.291 0.709 2
    0 3 0 38.879 1.121 2
    9 8 0 36.31 3.69 2
    10 5 0 35.54 4.46 2
    11 9 0 39.302 0.698 2
    0 2 0 39.633 0.367 2
    7 0 0 39.967 0.033 2
    4 1 0 38.503 1.497 3
    6 0 0 39.43 0.57 2
    4 8 0 28.724 11.276 2
    12 7 0 39.785 0.215 2
    5 4 0 38.793 1.207 2
    0 11 0 28.471 11.529 3
    0 12 0 38.576 1.424 2
    2 5 0 30.738 9.262 2
    3 2 0 38.694 1.306 3
    7 13 0 39.888 0.112 3
    1 13 0 33.292 6.708 2
    8 13 0 39.97 0.03 2
    1 12 0 34.502 5.498 2
    6 11 0 35.632 4.368 2
    2 10 0 38.462 1.538 3
    2 8 0 39.624 0.376 2
    9 2 0 39.886 0.114 2
    8 6 0 36.827 3.173 2
    12 11 0 39.42 0.58 2
    9 6 0 37.511 2.489 2
    0 5 0 36.768 3.232 2
    11 3 0 38.833 1.167 2
    1 10 0 28.937 11.063 2
    4 0 0 39.926 0.074 2
    2 0 0 38.998 1.002 2
    1 9 0 37.876 2.124 2
    3 7 0 29.337 10.663 2
    9 13 0 34.99 5.01 2
    8 0 0 39.192 0.808 2
    13 7 0 34.292 5.708 2
    8 10 0 34.599 5.401 2
    1 5 0 29.196 10.804 2
    12 5 0 39.166 0.834 3
    11 8 0 38.415 1.585 2
    1 8 0 37.069 2.931 3
    7 4 0 36.652 3.348 2
    3 6 0 35.262 4.738 2
    1 3 0 38.229 1.771 3
    0 12 1 34.926 5.074 1
    13 8 1 34.82 5.18 1
    13 9 1 34.296 5.704 1
    8 4 1 34.291 5.709 1
    7 11 1 34.015 5.985 1
    12 3 1 32.899 7.101 1
    10 4 1 32.788 7.212 1
    8 6 1 38.03 1.97 2
    10 8 1 37.846 2.154 2
    2 12 1 32.246 7.754 1
    8 11 1 39.265 0.735 2
    0 4 1 31.065 8.935 1
    4 3 1 30.752 9.248 1
    5 3 1 30.65 9.35 1
    3 13 1 39.885 0.115 2
    8 1 1 39.077 0.923 2
    7 9 1 30.096 9.904 1
    0 13 1 29.793 10.207 1
    2 8 1 37.906 2.094 2
    7 10 1 38.977 1.023 2
    7 2 1 29.346 10.654 1
    6 7 1 29.278 10.722 1
    9 2 1 29.097 10.903 1
    4 8 1 34.426 5.574 2
    10 7 1 39.084 0.916 2
    13 10 1 28.438 11.562 1
    12 10 1 38.388 1.612 2
    2 7 1 27.771 12.229 1
    2 9 1 36.732 3.268 2
    5 9 1 33.307 6.693 2
    12 8 1 39.204 0.796 2
    10 1 1 27.4 12.6 1
    4 9 1 27.381 12.619 1
    9 10 1 27.087 12.913 1
    10 9 1 27.053 12.947 1
    9 8 1 36.134 3.866 2
    5 4 1 39.812 0.188 2
    9 12 1 31.862 8.138 2
    5 12 1 38.745 1.255 2
    9 7 1 37.226 2.774 2
    5 2 1 39.331 0.669 2
    6 1 1 36.305 3.695 2
    0 6 1 38.382 1.618 2
    11 9 1 36.617 3.383 2
    2 6 1 39.218 0.782 2
    13 1 1 37.202 2.798 2
    13 11 1 39.681 0.319 2
    11 12 1 24.895 15.105 1
    4 0 1 39.2 0.8 2
    9 3 1 34.786 5.214 2
    6 2 1 30.357 9.643 2
    2 11 1 39.738 0.262 2
    4 12 1 23.906 16.094 1
    11 7 1 39.266 0.734 2
    6 13 1 37.743 2.257 3
    11 1 1 35.744 4.256 2
    6 3 1 22.947 17.053 1
    11 5 1 38.322 1.678 2
    2 3 1 22.619 17.381 1
    11 10 1 38.64 1.36 2
    13 4 1 39.782 0.218 2
    1 12 1 36.128 3.872 2
    11 3 1 37.721 2.279 2
    8 9 1 37.164 2.836 2
    1 2 1 39.306 0.694 2
    6 0 1 34.745 5.255 2
    13 2 1 36.235 3.765 2
    8 13 1 37.507 2.493 2
    3 10 1 33.351 6.649 2
    0 5 1 19.497 20.503 1
    10 3 1 35.147 4.853 2
    7 6 1 35.331 4.669 2
    10 5 1 37.635 2.365 2
    6 12 1 17.36 22.64 1
    3 2 1 39.793 0.207 3
    13 12 1 15.236 24.764 1
    13 7 1 14.151 25.849 1
    1 7 1 35.463 4.537 3
    8 5 1 24.753 15.247 2
    3 9 1 37.119 2.881 3
    5 6 1 15.398 24.602 2
    13 0 1 6.644 33.356 1
  • Getting VL with max free capacity among VLs with common source destination {(11, 2, 0): [5.308], (11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 9, 0): [13.833], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 8, 1): [5.18], (13, 9, 1): [5.704]}
  • List of VL ids with common source destination [(13, 9, 0), (13, 9, 1)]
    sdifreecapequal free capacities
    13 9 0 13.833
    13 9 1 5.704
  • Getting VL with max free capacity among VLs with common source destination {(11, 2, 0): [5.308], (11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 8, 1): [5.18], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (10, 4, 1): [7.212]}
  • List of VL ids with common source destination [(10, 4, 0), (10, 4, 1)]
    sdifreecapequal free capacities
    10 4 0 6.59
    10 4 1 7.212
  • Getting VL with max free capacity among VLs with common source destination {(11, 2, 0): [5.308], (11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (2, 12, 0): [13.044], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 8, 1): [5.18], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754]}
  • List of VL ids with common source destination [(2, 12, 0), (2, 12, 1)]
    sdifreecapequal free capacities
    2 12 0 13.044
    2 12 1 7.754
  • Getting VL with max free capacity among VLs with common source destination {(11, 2, 0): [5.308], (11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (7, 2, 0): [18.575], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 8, 1): [5.18], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654]}
  • List of VL ids with common source destination [(7, 2, 0), (7, 2, 1)]
    sdifreecapequal free capacities
    7 2 0 18.575
    7 2 1 10.654
  • Getting VL with max free capacity among VLs with common source destination {(11, 2, 0): [5.308], (11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 8, 1): [5.18], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (6, 7, 1): [10.722]}
  • List of VL ids with common source destination [(6, 7, 0), (6, 7, 1)]
    sdifreecapequal free capacities
    6 7 0 8.224
    6 7 1 10.722
  • Getting VL with max free capacity among VLs with common source destination {(11, 2, 0): [5.308], (11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (4, 8, 0): [11.276], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 8, 1): [5.18], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574]}
  • List of VL ids with common source destination [(4, 8, 0), (4, 8, 1)]
    sdifreecapequal free capacities
    4 8 0 11.276
    4 8 1 5.574
  • Getting VL with max free capacity among VLs with common source destination {(11, 2, 0): [5.308], (11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 8, 1): [5.18], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (2, 7, 1): [12.229]}
  • List of VL ids with common source destination [(2, 7, 0), (2, 7, 1)]
    sdifreecapequal free capacities
    2 7 0 9.025
    2 7 1 12.229
  • Getting VL with max free capacity among VLs with common source destination {(11, 2, 0): [5.308], (11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (4, 9, 0): [13.252], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 8, 1): [5.18], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619]}
  • List of VL ids with common source destination [(4, 9, 0), (4, 9, 1)]
    sdifreecapequal free capacities
    4 9 0 13.252
    4 9 1 12.619
  • Getting VL with max free capacity among VLs with common source destination {(11, 2, 0): [5.308], (11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (9, 10, 0): [19.338], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 8, 1): [5.18], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913]}
  • List of VL ids with common source destination [(9, 10, 0), (9, 10, 1)]
    sdifreecapequal free capacities
    9 10 0 19.338
    9 10 1 12.913
  • Getting VL with max free capacity among VLs with common source destination {(11, 2, 0): [5.308], (11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 8, 1): [5.18], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (10, 9, 1): [12.947]}
  • List of VL ids with common source destination [(10, 9, 0), (10, 9, 1)]
    sdifreecapequal free capacities
    10 9 0 9.359
    10 9 1 12.947
  • Getting VL with max free capacity among VLs with common source destination {(11, 2, 0): [5.308], (11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (11, 12, 0): [16.628], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 8, 1): [5.18], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105]}
  • List of VL ids with common source destination [(11, 12, 0), (11, 12, 1)]
    sdifreecapequal free capacities
    11 12 0 16.628
    11 12 1 15.105
  • Getting VL with max free capacity among VLs with common source destination {(11, 2, 0): [5.308], (11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (9, 3, 0): [18.188], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 8, 1): [5.18], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (9, 3, 1): [5.214]}
  • List of VL ids with common source destination [(9, 3, 0), (9, 3, 1)]
    sdifreecapequal free capacities
    9 3 0 18.188
    9 3 1 5.214
  • Getting VL with max free capacity among VLs with common source destination {(11, 2, 0): [5.308], (11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 8, 1): [5.18], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (9, 3, 1): [5.214], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (2, 3, 1): [17.381]}
  • List of VL ids with common source destination [(2, 3, 0), (2, 3, 1)]
    sdifreecapequal free capacities
    2 3 0 16.363
    2 3 1 17.381
  • Getting VL with max free capacity among VLs with common source destination {(11, 2, 0): [5.308], (11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (3, 10, 0): [7.47], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 8, 1): [5.18], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (9, 3, 1): [5.214], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (6, 0, 1): [5.255], (3, 10, 1): [6.649]}
  • List of VL ids with common source destination [(3, 10, 0), (3, 10, 1)]
    sdifreecapequal free capacities
    3 10 0 7.47
    3 10 1 6.649
  • Getting VL with max free capacity among VLs with common source destination {(11, 2, 0): [5.308], (11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 8, 1): [5.18], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (9, 3, 1): [5.214], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (6, 0, 1): [5.255], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 12, 1): [24.764]}
  • List of VL ids with common source destination [(13, 12, 0), (13, 12, 1)]
    sdifreecapequal free capacities
    13 12 0 9.567
    13 12 1 24.764
  • Getting VL with max free capacity among VLs with common source destination {(11, 2, 0): [5.308], (11, 10, 0): [5.423], (8, 9, 0): [5.49], (1, 6, 0): [5.758], (3, 1, 0): [5.821], (13, 1, 0): [5.866], (4, 13, 0): [6.216], (10, 4, 0): [6.59], (0, 9, 0): [6.691], (5, 11, 0): [7.114], (3, 8, 0): [7.118], (7, 3, 0): [7.72], (8, 7, 0): [7.943], (6, 7, 0): [8.224], (6, 9, 0): [8.276], (10, 12, 0): [8.798], (5, 2, 0): [8.806], (2, 7, 0): [9.025], (10, 9, 0): [9.359], (13, 12, 0): [9.567], (5, 8, 0): [9.749], (11, 7, 0): [9.93], (13, 11, 0): [11.259], (8, 2, 0): [5.759], (8, 12, 0): [6.754], (4, 2, 0): [12.755], (13, 2, 0): [14.463], (2, 3, 0): [16.363], (5, 12, 0): [16.887], (0, 6, 0): [18.526], (8, 3, 0): [8.353], (9, 11, 0): [7.474], (9, 5, 0): [8.243], (0, 11, 0): [11.529], (2, 5, 0): [9.262], (1, 13, 0): [6.708], (1, 12, 0): [5.498], (1, 10, 0): [11.063], (3, 7, 0): [10.663], (13, 7, 0): [5.708], (8, 10, 0): [5.401], (1, 5, 0): [10.804], (13, 8, 1): [5.18], (13, 9, 1): [5.704], (8, 4, 1): [5.709], (7, 11, 1): [5.985], (12, 3, 1): [7.101], (2, 12, 1): [7.754], (0, 4, 1): [8.935], (4, 3, 1): [9.248], (5, 3, 1): [9.35], (7, 9, 1): [9.904], (0, 13, 1): [10.207], (7, 2, 1): [10.654], (9, 2, 1): [10.903], (4, 8, 1): [5.574], (13, 10, 1): [11.562], (5, 9, 1): [6.693], (10, 1, 1): [12.6], (4, 9, 1): [12.619], (9, 10, 1): [12.913], (9, 12, 1): [8.138], (11, 12, 1): [15.105], (9, 3, 1): [5.214], (6, 2, 1): [9.643], (4, 12, 1): [16.094], (6, 3, 1): [17.053], (6, 0, 1): [5.255], (3, 10, 1): [6.649], (0, 5, 1): [20.503], (6, 12, 1): [22.64], (13, 7, 1): [25.849]}
  • List of VL ids with common source destination [(13, 7, 0), (13, 7, 1)]
    sdifreecapequal free capacities
    13 7 0 5.708
    13 7 1 25.849
  • New VT only having VL with adequate free capacity required by the traffic request for possible grooming.
    Source Destinations
    11 2 10 7 12
    8 9 7 2 12 3 10 4 5
    1 6 13 12 10 5
    3 1 8 7 10
    13 1 12 11 2 7 8 9 10 0
    4 13 2 3 8 9 12
    10 4 12 9 1
    0 9 6 11 4 13 5
    5 11 2 8 12 3 9 6
    7 3 11 9 2
    6 7 9 2 3 0 12
    2 7 3 5 12
    9 11 5 2 10 12 3
    12 3
  • New list of VL with adequate free capacity required by the traffic request for possible grooming.
    virtual link id free capacity
    source (s) destination (d) number of virtual link for (s,d)
    11 2 0 5.308
    11 10 0 5.423
    8 9 0 5.49
    1 6 0 5.758
    3 1 0 5.821
    13 1 0 5.866
    4 13 0 6.216
    10 4 0 6.59
    0 9 0 6.691
    5 11 0 7.114
    3 8 0 7.118
    7 3 0 7.72
    8 7 0 7.943
    6 7 0 8.224
    6 9 0 8.276
    10 12 0 8.798
    5 2 0 8.806
    2 7 0 9.025
    10 9 0 9.359
    13 12 0 9.567
    5 8 0 9.749
    11 7 0 9.93
    13 11 0 11.259
    8 2 0 5.759
    8 12 0 6.754
    4 2 0 12.755
    13 2 0 14.463
    2 3 0 16.363
    5 12 0 16.887
    0 6 0 18.526
    8 3 0 8.353
    9 11 0 7.474
    9 5 0 8.243
    0 11 0 11.529
    2 5 0 9.262
    1 13 0 6.708
    1 12 0 5.498
    1 10 0 11.063
    3 7 0 10.663
    13 7 0 5.708
    8 10 0 5.401
    1 5 0 10.804
    13 8 1 5.18
    13 9 1 5.704
    8 4 1 5.709
    7 11 1 5.985
    12 3 1 7.101
    2 12 1 7.754
    0 4 1 8.935
    4 3 1 9.248
    5 3 1 9.35
    7 9 1 9.904
    0 13 1 10.207
    7 2 1 10.654
    9 2 1 10.903
    4 8 1 5.574
    13 10 1 11.562
    5 9 1 6.693
    10 1 1 12.6
    4 9 1 12.619
    9 10 1 12.913
    9 12 1 8.138
    11 12 1 15.105
    9 3 1 5.214
    6 2 1 9.643
    4 12 1 16.094
    6 3 1 17.053
    6 0 1 5.255
    3 10 1 6.649
    0 5 1 20.503
    6 12 1 22.64
    8 5 1 15.247
    5 6 1 24.602
    13 0 1 33.356
  • [Finding shortest path with minimum hops] Input graph: {11: [2, 10, 7, 12], 8: [9, 7, 2, 12, 3, 10, 4, 5], 1: [6, 13, 12, 10, 5], 3: [1, 8, 7, 10], 13: [1, 12, 11, 2, 7, 8, 9, 10, 0], 4: [13, 2, 3, 8, 9, 12], 10: [4, 12, 9, 1], 0: [9, 6, 11, 4, 13, 5], 5: [11, 2, 8, 12, 3, 9, 6], 7: [3, 11, 9, 2], 6: [7, 9, 2, 3, 0, 12], 2: [7, 3, 5, 12], 9: [11, 5, 2, 10, 12, 3], 12: [3]}
  • Source: 4
  • Destination: 2
  • All paths [4, 2] .
  • Processing path [4, 2]
  • Path2links [[4, 2]]
  • Traffic grooming: Routing the required capacity via this path!
  • Links of the path [[4, 2]]
  • Subtract the utilised capacity from the Link's [4, 2] free capacity.
  • Update value is -5.114
  • Updated Virtual Link's (4,2,0) free capacity to 7.641.
  • que 1 req 181 (src 4 dst 2 num 0) type Grm capacity 5.114 step of routing reqquested traffic 0 step's virtual link sequence number 0
  • Insert routing of request over virtual links. QueueID: 1 RequestID: 181 VirtualLinkID: 0 (src: 4 dst: 2 ), Required Capacity: 5.114 Free Capacity (on the graph): 7.641 Free Capacity (on the corresponding array:) 7.641 Grooming: Yes (value==1).
  • Request routed successfully over an existing path!
  • Remaining capacity for this request is 0.0
  • Update of the Traffic Requests for each Virtual Link
    {(s,d,n):[(que,req,cap,type),...],...}
    JustificationKeyValue
    Update key value(4,2,0)[(0,60,27.245,'New'),(1,181,5.114,'Grm')]
    Update of the Virtual Link Totals
    {(s,d,n):[caputil, capfree, num_of_TReqs],...}
    JustificationKeyValue
    Update key value(4,2,0)[32.359,7.641,2]
    Update of the Virtual Links per Request R
    {(queue, request number): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...}
    JustificationKeyValue
    Update key value(1,181)[(4,2,0,'Grm',5.114,0,0)]
    Virtual Topology vT = {13: [10, 1, 12, 3, 4, 11, 0, 5, 9, 2, 8, 6, 7], 11: [2, 10, 13, 4, 1, 7, 6, 12, 5, 0, 9, 3, 8], 8: [9, 7, 11, 2, 12, 5, 4, 3, 1, 13, 6, 0, 10], 1: [2, 6, 4, 7, 0, 11, 13, 12, 10, 9, 5, 8, 3], 3: [1, 9, 8, 10, 5, 12, 13, 4, 11, 0, 2, 7, 6], 4: [13, 11, 3, 7, 2, 9, 6, 10, 5, 12, 1, 8, 0], 10: [4, 12, 9, 0, 8, 2, 13, 11, 7, 3, 6, 1, 5], 0: [9, 1, 8, 7, 13, 6, 10, 4, 3, 2, 11, 12, 5], 5: [11, 1, 2, 8, 7, 3, 13, 12, 10, 0, 6, 9, 4], 7: [3, 1, 9, 12, 6, 2, 5, 11, 8, 10, 0, 13, 4], 12: [8, 9, 13, 0, 10, 3, 4, 2, 1, 6, 7, 11, 5], 6: [7, 9, 10, 4, 13, 3, 8, 1, 12, 2, 5, 0, 11], 2: [7, 4, 12, 6, 3, 11, 13, 9, 1, 5, 10, 8, 0], 9: [4, 7, 3, 10, 11, 5, 12, 0, 1, 8, 2, 6, 13]}

    VT_after_Step364_Que1_Req181.html

    Time of processing all requests 2726.695, Time of current queue's turn 26.695

    The Virtual Topology

    The final Virtual Topology


    Strategy utilised for the scheduling of the queue(s): QhpDirectQlpMultihop

    The Virtual Topology {node: [list of neighbour nodes], ...} (vT)
    Source Destinations
    13 10 1 12 3 4 11 0 5 9 2 8 6 7
    11 2 10 13 4 1 7 6 12 5 0 9 3 8
    8 9 7 11 2 12 5 4 3 1 13 6 0 10
    1 2 6 4 7 0 11 13 12 10 9 5 8 3
    3 1 9 8 10 5 12 13 4 11 0 2 7 6
    4 13 11 3 7 2 9 6 10 5 12 1 8 0
    10 4 12 9 0 8 2 13 11 7 3 6 1 5
    0 9 1 8 7 13 6 10 4 3 2 11 12 5
    5 11 1 2 8 7 3 13 12 10 0 6 9 4
    7 3 1 9 12 6 2 5 11 8 10 0 13 4
    12 8 9 13 0 10 3 4 2 1 6 7 11 5
    6 7 9 10 4 13 3 8 1 12 2 5 0 11
    2 7 4 12 6 3 11 13 9 1 5 10 8 0
    9 4 7 3 10 11 5 12 0 1 8 2 6 13
    Virtual Links used for each traffic request {(queue id, request id): [(virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number), ...], ...} (R)
    queue request (virtual link (s,d,n), type, capacity utilised, step of routing the requested capacity, step's virtual link sequence number)
    0 0 (13, 10, 0, 'New', 34.927, 0, 0)
    0 1 (11, 2, 0, 'New', 34.692, 0, 0)
    0 2 (11, 10, 0, 'New', 34.577, 0, 0)
    0 3 (8, 9, 0, 'New', 34.51, 0, 0)
    0 4 (1, 2, 0, 'New', 34.253, 0, 0)
    0 5 (1, 6, 0, 'New', 34.242, 0, 0)
    0 6 (3, 1, 0, 'New', 34.179, 0, 0)
    0 7 (13, 1, 0, 'New', 34.134, 0, 0)
    0 8 (4, 13, 0, 'New', 33.784, 0, 0)
    0 9 (10, 4, 0, 'New', 33.41, 0, 0)
    0 10 (0, 9, 0, 'New', 33.309, 0, 0)
    0 11 (3, 9, 0, 'New', 32.965, 0, 0)
    0 12 (5, 11, 0, 'New', 32.886, 0, 0)
    0 13 (3, 8, 0, 'New', 32.882, 0, 0)
    0 14 (3, 10, 0, 'New', 32.53, 0, 0)
    0 15 (7, 3, 0, 'New', 32.28, 0, 0)
    0 16 (12, 8, 0, 'New', 32.124, 0, 0)
    0 17 (8, 7, 0, 'New', 32.057, 0, 0)
    0 18 (11, 13, 0, 'New', 31.968, 0, 0)
    0 19 (6, 7, 0, 'New', 31.776, 0, 0)
    0 20 (5, 1, 0, 'New', 31.774, 0, 0)
    0 21 (6, 9, 0, 'New', 31.724, 0, 0)
    0 22 (10, 12, 0, 'New', 31.202, 0, 0)
    0 23 (5, 2, 0, 'New', 31.194, 0, 0)
    0 24 (2, 7, 0, 'New', 30.975, 0, 0)
    0 25 (10, 9, 0, 'New', 30.641, 0, 0)
    0 26 (1, 4, 0, 'New', 30.614, 0, 0)
    0 27 (11, 4, 0, 'New', 30.485, 0, 0)
    0 28 (13, 12, 0, 'New', 30.433, 0, 0)
    0 29 (5, 8, 0, 'New', 30.251, 0, 0)
    0 30 (11, 1, 0, 'New', 30.229, 0, 0)
    0 31 (11, 7, 0, 'New', 30.07, 0, 0)
    0 32 (9, 4, 0, 'New', 30.016, 0, 0)
    0 33 (7, 1, 0, 'New', 29.927, 0, 0)
    0 34 (5, 7, 0, 'New', 29.913, 0, 0)
    0 35 (6, 10, 0, 'New', 29.764, 0, 0)
    0 36 (3, 5, 0, 'New', 29.528, 0, 0)
    0 37 (2, 4, 0, 'New', 29.213, 0, 0)
    0 38 (4, 11, 0, 'New', 29.158, 0, 0)
    0 39 (7, 9, 0, 'New', 29.005, 0, 0)
    0 40 (0, 1, 0, 'New', 28.978, 0, 0)
    0 41 (0, 8, 0, 'New', 28.849, 0, 0)
    0 42 (13, 3, 0, 'New', 28.847, 0, 0)
    0 43 (13, 4, 0, 'New', 28.825, 0, 0)
    0 44 (13, 11, 0, 'New', 28.741, 0, 0)
    0 45 (13, 0, 0, 'New', 28.603, 0, 0)
    0 46 (8, 11, 0, 'New', 28.586, 0, 0)
    0 47 (4, 3, 0, 'New', 28.558, 0, 0)
    0 48 (7, 12, 0, 'New', 28.555, 0, 0)
    0 49 (12, 9, 0, 'New', 28.47, 0, 0)
    0 50 (8, 2, 0, 'New', 28.299, 0, 0)
    0 51 (4, 7, 0, 'New', 28.173, 0, 0)
    0 52 (12, 13, 0, 'New', 28.126, 0, 0)
    0 53 (1, 7, 0, 'New', 28.089, 0, 0)
    0 54 (9, 7, 0, 'New', 27.922, 0, 0)
    0 55 (1, 0, 0, 'New', 27.886, 0, 0)
    0 56 (8, 12, 0, 'New', 27.812, 0, 0)
    0 57 (13, 5, 0, 'New', 27.588, 0, 0)
    0 58 (11, 6, 0, 'New', 27.49, 0, 0)
    0 59 (5, 3, 0, 'New', 27.38, 0, 0)
    0 60 (4, 2, 0, 'New', 27.245, 0, 0)
    0 61 (7, 6, 0, 'New', 27.134, 0, 0)
    0 62 (10, 0, 0, 'New', 27.036, 0, 0)
    0 63 (2, 12, 0, 'New', 26.956, 0, 0)
    0 64 (4, 9, 0, 'New', 26.748, 0, 0)
    0 65 (13, 9, 0, 'New', 26.167, 0, 0)
    0 66 (2, 6, 0, 'New', 26.031, 0, 0)
    0 67 (5, 13, 0, 'New', 25.708, 0, 0)
    0 68 (6, 4, 0, 'New', 25.6, 0, 0)
    0 69 (13, 2, 0, 'New', 25.537, 0, 0)
    0 70 (8, 5, 0, 'New', 25.481, 0, 0)
    0 71 (12, 0, 0, 'New', 25.44, 0, 0)
    0 72 (0, 7, 0, 'New', 25.417, 0, 0)
    0 73 (13, 8, 0, 'New', 25.215, 0, 0)
    0 74 (13, 6, 0, 'New', 24.98, 0, 0)
    0 75 (10, 8, 0, 'New', 24.855, 0, 0)
    0 76 (10, 2, 0, 'New', 24.743, 0, 0)
    0 77 (0, 13, 0, 'New', 24.583, 0, 0)
    0 78 (3, 12, 0, 'New', 24.472, 0, 0)
    0 79 (4, 6, 0, 'New', 24.465, 0, 0)
    0 80 (10, 13, 0, 'New', 24.043, 0, 0)
    0 81 (6, 13, 0, 'New', 24.006, 0, 0)
    0 82 (6, 3, 0, 'New', 23.828, 0, 0)
    0 83 (10, 11, 0, 'New', 23.731, 0, 0)
    0 84 (2, 3, 0, 'New', 23.637, 0, 0)
    0 85 (12, 10, 0, 'New', 23.49, 0, 0)
    0 86 (11, 12, 0, 'New', 23.372, 0, 0)
    0 87 (2, 11, 0, 'New', 23.368, 0, 0)
    0 88 (5, 12, 0, 'New', 23.113, 0, 0)
    0 89 (4, 10, 0, 'New', 23.098, 0, 0)
    0 90 (11, 5, 0, 'New', 22.355, 0, 0)
    0 91 (12, 3, 0, 'New', 22.353, 0, 0)
    0 92 (6, 8, 0, 'New', 22.101, 0, 0)
    0 93 (8, 4, 0, 'New', 22.069, 0, 0)
    0 94 (9, 3, 0, 'New', 21.812, 0, 0)
    0 95 (3, 13, 0, 'New', 21.778, 0, 0)
    0 96 (0, 6, 0, 'New', 21.474, 0, 0)
    0 97 (7, 2, 0, 'New', 21.425, 0, 0)
    0 98 (2, 13, 0, 'New', 21.262, 0, 0)
    0 99 (7, 5, 0, 'New', 21.239, 0, 0)
    0 100 (0, 10, 0, 'New', 21.126, 0, 0)
    0 101 (5, 10, 0, 'New', 21.096, 0, 0)
    0 102 (5, 0, 0, 'New', 21.052, 0, 0)
    0 103 (3, 4, 0, 'New', 20.666, 0, 0)
    0 104 (9, 10, 0, 'New', 20.662, 0, 0)
    0 105 (4, 5, 0, 'New', 20.646, 0, 0)
    0 106 (1, 11, 0, 'New', 20.627, 0, 0)
    0 107 (2, 9, 0, 'New', 20.555, 0, 0)
    0 108 (12, 4, 0, 'New', 20.262, 0, 0)
    0 109 (4, 12, 0, 'New', 20.156, 0, 0)
    0 110 (8, 3, 0, 'New', 20.126, 0, 0)
    0 111 (9, 11, 0, 'New', 19.803, 0, 0)
    0 112 (6, 1, 0, 'New', 19.594, 0, 0)
    0 113 (12, 2, 0, 'New', 19.089, 0, 0)
    0 114 (10, 7, 0, 'New', 18.744, 0, 0)
    0 115 (2, 1, 0, 'New', 18.525, 0, 0)
    0 116 (6, 12, 0, 'New', 18.192, 0, 0)
    0 117 (10, 3, 0, 'New', 18.079, 0, 0)
    0 118 (0, 4, 0, 'New', 17.721, 0, 0)
    0 119 (9, 5, 0, 'New', 17.237, 0, 0)
    0 120 (3, 11, 0, 'New', 17.014, 0, 0)
    0 121 (3, 0, 0, 'New', 16.747, 0, 0)
    0 122 (7, 11, 0, 'New', 16.71, 0, 0)
    0 123 (11, 0, 0, 'New', 16.593, 0, 0)
    0 124 (6, 2, 0, 'New', 16.583, 0, 0)
    0 125 (12, 1, 0, 'New', 16.488, 0, 0)
    0 126 (6, 5, 0, 'New', 16.444, 0, 0)
    0 127 (5, 6, 0, 'New', 16.247, 0, 0)
    0 128 (9, 12, 0, 'New', 15.92, 0, 0)
    0 129 (12, 6, 0, 'New', 15.891, 0, 0)
    0 130 (7, 8, 0, 'New', 15.747, 0, 0)
    0 131 (10, 6, 0, 'New', 15.516, 0, 0)
    0 132 (8, 1, 0, 'New', 15.407, 0, 0)
    0 133 (9, 0, 0, 'New', 15.179, 0, 0)
    0 134 (10, 1, 0, 'New', 14.658, 0, 0)
    0 135 (7, 10, 0, 'New', 14.494, 0, 0)
    0 136 (9, 1, 0, 'New', 14.467, 0, 0)
    0 137 (5, 9, 0, 'New', 14.437, 0, 0)
    0 138 (0, 3, 0, 'New', 13.992, 0, 0)
    0 139 (9, 8, 0, 'New', 13.938, 0, 0)
    0 140 (10, 5, 0, 'New', 13.448, 0, 0)
    0 141 (11, 9, 0, 'New', 13.445, 0, 0)
    0 142 (0, 2, 0, 'New', 13.19, 0, 0)
    0 143 (7, 0, 0, 'New', 12.377, 0, 0)
    0 144 (4, 1, 0, 'New', 12.3, 0, 0)
    0 145 (6, 0, 0, 'New', 11.91, 0, 0)
    0 146 (4, 8, 0, 'New', 11.487, 0, 0)
    0 147 (12, 7, 0, 'New', 11.392, 0, 0)
    0 148 (5, 4, 0, 'New', 11.203, 0, 0)
    0 149 (0, 11, 0, 'New', 11.165, 0, 0)
    0 150 (0, 12, 0, 'New', 11.056, 0, 0)
    0 151 (2, 5, 0, 'New', 10.878, 0, 0)
    0 152 (3, 2, 0, 'New', 10.458, 0, 0)
    0 153 (7, 13, 0, 'New', 10.357, 0, 0)
    0 154 (1, 13, 0, 'New', 10.18, 0, 0)
    0 155 (8, 13, 0, 'New', 9.942, 0, 0)
    0 156 (1, 12, 0, 'New', 9.936, 0, 0)
    0 157 (6, 11, 0, 'New', 9.775, 0, 0)
    0 158 (2, 10, 0, 'New', 9.638, 0, 0)
    0 159 (2, 8, 0, 'New', 9.596, 0, 0)
    0 160 (9, 2, 0, 'New', 9.403, 0, 0)
    0 161 (8, 6, 0, 'New', 9.307, 0, 0)
    0 162 (12, 11, 0, 'New', 9.302, 0, 0)
    0 163 (9, 6, 0, 'New', 9.215, 0, 0)
    0 164 (0, 5, 0, 'New', 9.178, 0, 0)
    0 165 (11, 3, 0, 'New', 8.909, 0, 0)
    0 166 (1, 10, 0, 'New', 8.812, 0, 0)
    0 167 (4, 0, 0, 'New', 8.748, 0, 0)
    0 168 (2, 0, 0, 'New', 8.515, 0, 0)
    0 169 (1, 9, 0, 'New', 8.067, 0, 0)
    0 170 (3, 7, 0, 'New', 7.901, 0, 0)
    0 171 (9, 13, 0, 'New', 7.4, 0, 0)
    0 172 (8, 0, 0, 'New', 6.818, 0, 0)
    0 173 (13, 7, 0, 'New', 6.702, 0, 0)
    0 174 (8, 10, 0, 'New', 6.56, 0, 0)
    0 175 (1, 5, 0, 'New', 6.378, 0, 0)
    0 176 (12, 5, 0, 'New', 6.217, 0, 0)
    0 177 (11, 8, 0, 'New', 6.041, 0, 0)
    0 178 (1, 8, 0, 'New', 5.971, 0, 0)
    0 179 (7, 4, 0, 'New', 5.474, 0, 0)
    0 180 (3, 6, 0, 'New', 5.338, 0, 0)
    0 181 (1, 3, 0, 'New', 5.227, 0, 0)
    1 0 (0, 12, 1, 'New', 34.926, 0, 0)
    1 1 (13, 8, 1, 'New', 34.82, 0, 0)
    1 2 (13, 9, 1, 'New', 34.296, 0, 0)
    1 3 (8, 4, 1, 'New', 34.291, 0, 0)
    1 4 (7, 11, 1, 'New', 34.015, 0, 0)
    1 5 (12, 3, 1, 'New', 32.899, 0, 0)
    1 6 (10, 4, 1, 'New', 32.788, 0, 0)
    1 7 (8, 6, 1, 'New', 32.642, 0, 0)
    1 8 (10, 8, 1, 'New', 32.479, 0, 0)
    1 9 (11, 8, 0, 'Grm', 32.374, 0, 0)
    (8, 0, 0, 'Grm', 32.374, 0, 1)
    1 10 (2, 12, 1, 'New', 32.246, 0, 0)
    1 11 (8, 11, 1, 'New', 31.492, 0, 0)
    1 12 (7, 4, 0, 'Grm', 31.178, 0, 0)
    (4, 0, 0, 'Grm', 31.178, 0, 1)
    1 13 (0, 4, 1, 'New', 31.065, 0, 0)
    1 14 (4, 3, 1, 'New', 30.752, 0, 0)
    1 15 (5, 3, 1, 'New', 30.65, 0, 0)
    1 16 (9, 2, 0, 'Grm', 30.483, 0, 0)
    (2, 0, 0, 'Grm', 30.483, 0, 1)
    1 17 (3, 13, 1, 'New', 30.282, 0, 0)
    1 18 (8, 1, 1, 'New', 30.205, 0, 0)
    1 19 (12, 11, 0, 'Grm', 30.118, 0, 0)
    1 20 (7, 9, 1, 'New', 30.096, 0, 0)
    1 21 (2, 8, 0, 'Grm', 30.028, 0, 0)
    (8, 13, 0, 'Grm', 30.028, 0, 1)
    1 22 (11, 3, 0, 'Grm', 29.924, 0, 0)
    (3, 6, 0, 'Grm', 29.924, 0, 1)
    1 23 (1, 9, 0, 'Grm', 29.809, 0, 0)
    1 24 (0, 13, 1, 'New', 29.793, 0, 0)
    1 25 (2, 8, 1, 'New', 29.53, 0, 0)
    1 26 (7, 10, 1, 'New', 29.452, 0, 0)
    1 27 (7, 2, 1, 'New', 29.346, 0, 0)
    1 28 (6, 7, 1, 'New', 29.278, 0, 0)
    1 29 (9, 2, 1, 'New', 29.097, 0, 0)
    1 30 (4, 8, 1, 'New', 29.038, 0, 0)
    1 31 (10, 7, 1, 'New', 28.698, 0, 0)
    1 32 (13, 10, 1, 'New', 28.438, 0, 0)
    1 33 (12, 7, 0, 'Grm', 28.393, 0, 0)
    1 34 (9, 6, 0, 'Grm', 28.296, 0, 0)
    1 35 (8, 10, 0, 'Grm', 28.039, 0, 0)
    1 36 (12, 10, 1, 'New', 27.872, 0, 0)
    1 37 (2, 7, 1, 'New', 27.771, 0, 0)
    1 38 (2, 9, 1, 'New', 27.755, 0, 0)
    1 39 (9, 13, 0, 'Grm', 27.59, 0, 0)
    (13, 7, 0, 'Grm', 27.59, 0, 1)
    (7, 0, 0, 'Grm', 27.59, 0, 2)
    (0, 5, 0, 'Grm', 27.59, 0, 3)
    (5, 4, 0, 'Grm', 27.59, 0, 4)
    1 40 (5, 9, 1, 'New', 27.551, 0, 0)
    1 41 (8, 6, 0, 'Grm', 27.52, 0, 0)
    (6, 0, 0, 'Grm', 27.52, 0, 1)
    (0, 12, 0, 'Grm', 27.52, 0, 2)
    1 42 (12, 8, 1, 'New', 27.495, 0, 0)
    1 43 (10, 1, 1, 'New', 27.4, 0, 0)
    1 44 (4, 9, 1, 'New', 27.381, 0, 0)
    1 45 (9, 10, 1, 'New', 27.087, 0, 0)
    1 46 (10, 9, 1, 'New', 27.053, 0, 0)
    1 47 (0, 2, 0, 'Grm', 26.443, 0, 0)
    1 48 (9, 8, 1, 'New', 26.269, 0, 0)
    1 49 (5, 4, 1, 'New', 26.255, 0, 0)
    1 50 (9, 12, 1, 'New', 26.131, 0, 0)
    1 51 (5, 12, 1, 'New', 26.022, 0, 0)
    1 52 (9, 7, 1, 'New', 26.002, 0, 0)
    1 53 (6, 11, 0, 'Grm', 25.857, 0, 0)
    (11, 9, 0, 'Grm', 25.857, 0, 1)
    1 54 (5, 2, 1, 'New', 25.642, 0, 0)
    1 55 (6, 1, 1, 'New', 25.614, 0, 0)
    1 56 (0, 6, 1, 'New', 25.539, 0, 0)
    1 57 (11, 9, 1, 'New', 25.534, 0, 0)
    1 58 (2, 6, 1, 'New', 25.529, 0, 0)
    1 59 (13, 1, 1, 'New', 25.479, 0, 0)
    1 60 (13, 11, 1, 'New', 24.927, 0, 0)
    1 61 (11, 12, 1, 'New', 24.895, 0, 0)
    1 62 (0, 3, 0, 'Grm', 24.887, 0, 0)
    1 63 (12, 5, 0, 'Grm', 24.854, 0, 0)
    (5, 9, 0, 'Grm', 24.854, 0, 1)
    (9, 1, 0, 'Grm', 24.854, 0, 2)
    1 64 (4, 0, 1, 'New', 24.736, 0, 0)
    1 65 (9, 3, 1, 'New', 24.628, 0, 0)
    1 66 (10, 1, 0, 'Grm', 24.566, 0, 0)
    (1, 12, 0, 'Grm', 24.566, 0, 1)
    1 67 (6, 2, 1, 'New', 24.514, 0, 0)
    1 68 (2, 11, 1, 'New', 24.083, 0, 0)
    1 69 (4, 12, 1, 'New', 23.906, 0, 0)
    1 70 (1, 3, 0, 'Grm', 23.399, 0, 0)
    1 71 (11, 7, 1, 'New', 23.399, 0, 0)
    1 72 (6, 13, 1, 'New', 23.393, 0, 0)
    1 73 (9, 12, 0, 'Grm', 23.112, 0, 0)
    (12, 1, 0, 'Grm', 23.112, 0, 1)
    (1, 13, 0, 'Grm', 23.112, 0, 2)
    1 74 (11, 1, 1, 'New', 23.021, 0, 0)
    1 75 (6, 3, 1, 'New', 22.947, 0, 0)
    1 76 (1, 5, 0, 'Grm', 22.818, 0, 0)
    1 77 (11, 5, 1, 'New', 22.667, 0, 0)
    1 78 (2, 3, 1, 'New', 22.619, 0, 0)
    1 79 (9, 8, 0, 'Grm', 22.372, 0, 0)
    (8, 1, 0, 'Grm', 22.372, 0, 1)
    1 80 (6, 5, 0, 'Grm', 22.299, 0, 0)
    1 81 (11, 10, 1, 'New', 22.283, 0, 0)
    1 82 (13, 4, 1, 'New', 22.24, 0, 0)
    1 83 (10, 6, 0, 'Grm', 22.212, 0, 0)
    (6, 2, 0, 'Grm', 22.212, 0, 1)
    1 84 (7, 10, 0, 'Grm', 22.092, 0, 0)
    (10, 5, 0, 'Grm', 22.092, 0, 1)
    1 85 (1, 12, 1, 'New', 22.079, 0, 0)
    1 86 (11, 3, 1, 'New', 22.011, 0, 0)
    1 87 (8, 9, 1, 'New', 21.641, 0, 0)
    1 88 (10, 3, 0, 'Grm', 21.436, 0, 0)
    (3, 7, 0, 'Grm', 21.436, 0, 1)
    (7, 13, 0, 'Grm', 21.436, 0, 2)
    1 89 (1, 2, 1, 'New', 21.077, 0, 0)
    1 90 (6, 0, 1, 'New', 21.056, 0, 0)
    1 91 (13, 2, 1, 'New', 20.525, 0, 0)
    1 92 (6, 12, 0, 'Grm', 20.407, 0, 0)
    (12, 2, 0, 'Grm', 20.407, 0, 1)
    (2, 1, 0, 'Grm', 20.407, 0, 2)
    (1, 8, 0, 'Grm', 20.407, 0, 3)
    1 93 (8, 13, 1, 'New', 20.27, 0, 0)
    1 94 (4, 1, 0, 'Grm', 20.125, 0, 0)
    (1, 10, 0, 'Grm', 20.125, 0, 1)
    (10, 7, 0, 'Grm', 20.125, 0, 2)
    1 95 (3, 2, 0, 'Grm', 19.86, 0, 0)
    (2, 5, 0, 'Grm', 19.86, 0, 1)
    1 96 (3, 10, 1, 'New', 19.744, 0, 0)
    1 97 (0, 5, 1, 'New', 19.497, 0, 0)
    1 98 (3, 0, 0, 'Grm', 19.483, 0, 0)
    1 99 (11, 0, 0, 'Grm', 19.476, 0, 0)
    (0, 4, 0, 'Grm', 19.476, 0, 1)
    1 100 (10, 3, 1, 'New', 19.468, 0, 0)
    1 101 (7, 6, 1, 'New', 19.464, 0, 0)
    1 102 (10, 5, 1, 'New', 19.406, 0, 0)
    1 103 (2, 9, 0, 'Grm', 18.795, 0, 0)
    (9, 0, 0, 'Grm', 18.795, 0, 1)
    1 104 (1, 2, 1, 'Grm', 18.229, 0, 0)
    (2, 10, 0, 'Grm', 18.229, 0, 1)
    (10, 5, 1, 'Grm', 18.229, 0, 2)
    (5, 6, 0, 'Grm', 18.229, 0, 3)
    1 105 (7, 8, 0, 'Grm', 18.122, 0, 0)
    1 106 (2, 13, 0, 'Grm', 17.542, 0, 0)
    (13, 4, 1, 'Grm', 17.542, 0, 1)
    (4, 12, 0, 'Grm', 17.542, 0, 2)
    (12, 6, 0, 'Grm', 17.542, 0, 3)
    (6, 1, 0, 'Grm', 17.542, 0, 4)
    1 107 (6, 12, 1, 'New', 17.36, 0, 0)
    1 108 (4, 8, 0, 'Grm', 17.237, 0, 0)
    (8, 13, 1, 'Grm', 17.237, 0, 1)
    1 109 (5, 10, 0, 'Grm', 16.49, 0, 0)
    1 110 (1, 11, 0, 'Grm', 16.357, 0, 0)
    (11, 10, 1, 'Grm', 16.357, 0, 1)
    1 111 (12, 10, 0, 'Grm', 15.867, 0, 0)
    (10, 11, 0, 'Grm', 15.867, 0, 1)
    (11, 7, 1, 'Grm', 15.867, 0, 2)
    (7, 6, 1, 'Grm', 15.867, 0, 3)
    1 112 (11, 3, 1, 'Grm', 15.71, 0, 0)
    (3, 13, 0, 'Grm', 15.71, 0, 1)
    (13, 2, 1, 'Grm', 15.71, 0, 2)
    1 113 (10, 3, 1, 'Grm', 15.679, 0, 0)
    (3, 4, 0, 'Grm', 15.679, 0, 1)
    (4, 5, 0, 'Grm', 15.679, 0, 2)
    (5, 0, 0, 'Grm', 15.679, 0, 3)
    1 114 (2, 11, 1, 'Grm', 15.655, 0, 0)
    (11, 5, 1, 'Grm', 15.655, 0, 1)
    1 115 (12, 4, 0, 'Grm', 15.523, 0, 0)
    (4, 6, 0, 'Grm', 15.523, 0, 1)
    (6, 8, 0, 'Grm', 15.523, 0, 2)
    (8, 9, 1, 'Grm', 15.523, 0, 3)
    1 116 (3, 2, 1, 'New', 15.335, 0, 0)
    1 117 (13, 12, 1, 'New', 15.236, 0, 0)
    1 118 (13, 11, 1, 'Grm', 14.754, 0, 0)
    (11, 5, 0, 'Grm', 14.754, 0, 1)
    1 119 (9, 5, 0, 'Grm', 14.52, 0, 0)
    1 120 (8, 4, 0, 'Grm', 14.464, 0, 0)
    (4, 0, 1, 'Grm', 14.464, 0, 1)
    (0, 7, 0, 'Grm', 14.464, 0, 2)
    1 121 (13, 7, 1, 'New', 14.151, 0, 0)
    1 122 (6, 3, 0, 'Grm', 14.138, 0, 0)
    (3, 11, 0, 'Grm', 14.138, 0, 1)
    1 123 (1, 12, 1, 'Grm', 14.049, 0, 0)
    (12, 0, 0, 'Grm', 14.049, 0, 1)
    (0, 13, 0, 'Grm', 14.049, 0, 2)
    1 124 (1, 7, 1, 'New', 13.927, 0, 0)
    1 125 (1, 7, 1, 'Grm', 13.921, 0, 0)
    (7, 5, 0, 'Grm', 13.921, 0, 1)
    (5, 13, 0, 'Grm', 13.921, 0, 2)
    (13, 8, 0, 'Grm', 13.921, 0, 3)
    1 126 (3, 2, 1, 'Grm', 13.729, 0, 0)
    (2, 6, 0, 'Grm', 13.729, 0, 1)
    1 127 (8, 5, 0, 'Grm', 13.689, 0, 0)
    (5, 2, 1, 'Grm', 13.689, 0, 1)
    (2, 6, 1, 'Grm', 13.689, 0, 2)
    (6, 0, 1, 'Grm', 13.689, 0, 3)
    1 128 (3, 10, 1, 'Grm', 13.607, 0, 0)
    (10, 13, 0, 'Grm', 13.607, 0, 1)
    (13, 6, 0, 'Grm', 13.607, 0, 2)
    (6, 4, 0, 'Grm', 13.607, 0, 3)
    1 129 (5, 4, 1, 'Grm', 13.557, 0, 0)
    (4, 10, 0, 'Grm', 13.557, 0, 1)
    (10, 8, 0, 'Grm', 13.557, 0, 2)
    1 130 (8, 5, 1, 'New', 13.044, 0, 0)
    1 131 (3, 9, 1, 'New', 12.885, 0, 0)
    1 132 (10, 0, 0, 'Grm', 12.843, 0, 0)
    (0, 6, 1, 'Grm', 12.843, 0, 1)
    1 133 (5, 12, 1, 'Grm', 12.723, 0, 0)
    (12, 3, 0, 'Grm', 12.723, 0, 1)
    (3, 9, 1, 'Grm', 12.723, 0, 2)
    (9, 11, 0, 'Grm', 12.723, 0, 3)
    (11, 1, 1, 'Grm', 12.723, 0, 4)
    1 134 (3, 12, 0, 'Grm', 11.723, 0, 0)
    (12, 13, 0, 'Grm', 11.723, 0, 1)
    (13, 1, 1, 'Grm', 11.723, 0, 2)
    1 135 (0, 10, 0, 'Grm', 11.722, 0, 0)
    1 136 (12, 8, 1, 'Grm', 11.709, 0, 0)
    (8, 5, 1, 'Grm', 11.709, 0, 1)
    1 137 (1, 0, 0, 'Grm', 11.542, 0, 0)
    1 138 (8, 3, 0, 'Grm', 11.521, 0, 0)
    1 139 (3, 9, 1, 'Grm', 11.511, 0, 0)
    (9, 7, 0, 'Grm', 11.511, 0, 1)
    1 140 (12, 9, 0, 'Grm', 11.224, 0, 0)
    (9, 7, 1, 'Grm', 11.224, 0, 1)
    (7, 6, 0, 'Grm', 11.224, 0, 2)
    (6, 13, 0, 'Grm', 11.224, 0, 3)
    1 141 (0, 11, 0, 'Grm', 11.083, 0, 0)
    (11, 9, 1, 'Grm', 11.083, 0, 1)
    1 142 (5, 3, 0, 'Grm', 10.729, 0, 0)
    (3, 2, 1, 'Grm', 10.729, 0, 1)
    (2, 11, 0, 'Grm', 10.729, 0, 2)
    1 143 (11, 6, 0, 'Grm', 10.691, 0, 0)
    (6, 1, 1, 'Grm', 10.691, 0, 1)
    (1, 8, 0, 'Grm', 10.691, 0, 2)
    1 144 (2, 10, 0, 'Grm', 10.595, 0, 0)
    1 145 (12, 10, 1, 'Grm', 10.516, 0, 0)
    (10, 2, 0, 'Grm', 10.516, 0, 1)
    (2, 4, 0, 'Grm', 10.516, 0, 2)
    1 146 (10, 7, 1, 'Grm', 10.386, 0, 0)
    (7, 11, 0, 'Grm', 10.386, 0, 1)
    1 147 (4, 3, 0, 'Grm', 10.165, 0, 0)
    (3, 5, 0, 'Grm', 10.165, 0, 1)
    1 148 (7, 9, 0, 'Grm', 10.158, 0, 0)
    (9, 3, 1, 'Grm', 10.158, 0, 1)
    1 149 (4, 11, 0, 'Grm', 9.926, 0, 0)
    1 150 (9, 8, 1, 'Grm', 9.865, 0, 0)
    (8, 11, 0, 'Grm', 9.865, 0, 1)
    1 151 (11, 1, 0, 'Grm', 9.603, 0, 0)
    (1, 3, 0, 'Grm', 9.603, 0, 1)
    (3, 13, 1, 'Grm', 9.603, 0, 2)
    1 152 (4, 7, 0, 'Grm', 9.525, 0, 0)
    (7, 10, 1, 'Grm', 9.525, 0, 1)
    1 153 (1, 4, 0, 'Grm', 9.019, 0, 0)
    1 154 (2, 9, 1, 'Grm', 8.977, 0, 0)
    (9, 4, 0, 'Grm', 8.977, 0, 1)
    1 155 (6, 13, 1, 'Grm', 8.925, 0, 0)
    (13, 4, 0, 'Grm', 8.925, 0, 1)
    1 156 (0, 1, 0, 'Grm', 8.902, 0, 0)
    (1, 7, 0, 'Grm', 8.902, 0, 1)
    1 157 (0, 8, 0, 'Grm', 8.872, 0, 0)
    (8, 1, 1, 'Grm', 8.872, 0, 1)
    1 158 (7, 11, 0, 'Grm', 8.761, 0, 0)
    (11, 4, 0, 'Grm', 8.761, 0, 1)
    1 159 (3, 2, 0, 'Grm', 8.376, 0, 0)
    (2, 8, 1, 'Grm', 8.376, 0, 1)
    1 160 (12, 5, 0, 'Grm', 8.095, 0, 0)
    (5, 7, 0, 'Grm', 8.095, 0, 1)
    (7, 13, 0, 'Grm', 8.095, 0, 2)
    (13, 0, 0, 'Grm', 8.095, 0, 3)
    1 161 (5, 6, 1, 'New', 7.96, 0, 0)
    1 162 (6, 10, 0, 'Grm', 7.941, 0, 0)
    1 163 (7, 12, 0, 'Grm', 7.773, 0, 0)
    (12, 8, 0, 'Grm', 7.773, 0, 1)
    (8, 11, 1, 'Grm', 7.773, 0, 2)
    (11, 13, 0, 'Grm', 7.773, 0, 3)
    1 164 (5, 1, 0, 'Grm', 7.615, 0, 0)
    (1, 7, 1, 'Grm', 7.615, 0, 1)
    1 165 (13, 5, 0, 'Grm', 7.438, 0, 0)
    (5, 6, 1, 'Grm', 7.438, 0, 1)
    1 166 (13, 3, 0, 'Grm', 7.403, 0, 0)
    1 167 (13, 0, 1, 'New', 6.644, 0, 0)
    1 168 (0, 11, 0, 'Grm', 6.223, 0, 0)
    1 169 (4, 1, 0, 'Grm', 6.078, 0, 0)
    1 170 (8, 2, 0, 'Grm', 5.942, 0, 0)
    1 171 (12, 6, 0, 'Grm', 5.843, 0, 0)
    (6, 2, 1, 'Grm', 5.843, 0, 1)
    1 172 (7, 1, 0, 'Grm', 5.815, 0, 0)
    1 173 (5, 9, 1, 'Grm', 5.756, 0, 0)
    (9, 0, 0, 'Grm', 5.756, 0, 1)
    1 174 (3, 9, 0, 'Grm', 5.731, 0, 0)
    (9, 12, 1, 'Grm', 5.731, 0, 1)
    1 175 (3, 11, 0, 'Grm', 5.59, 0, 0)
    1 176 (7, 8, 0, 'Grm', 5.434, 0, 0)
    (8, 12, 0, 'Grm', 5.434, 0, 1)
    1 177 (5, 6, 0, 'Grm', 5.425, 0, 0)
    (6, 13, 1, 'Grm', 5.425, 0, 1)
    1 178 (4, 8, 1, 'Grm', 5.388, 0, 0)
    (8, 6, 1, 'Grm', 5.388, 0, 1)
    1 179 (0, 10, 0, 'Grm', 5.367, 0, 0)
    (10, 8, 1, 'Grm', 5.367, 0, 1)
    1 180 (1, 2, 0, 'Grm', 5.355, 0, 0)
    (2, 11, 0, 'Grm', 5.355, 0, 1)
    1 181 (4, 2, 0, 'Grm', 5.114, 0, 0)
  • Virtual Link IDs = {(s,d):[0,1,2,...],...}
    virtual link src,dst ID numbers
    source (s) destination (d)
    13 10 0 1
    11 2 0
    11 10 0 1
    8 9 0 1
    1 2 0 1
    1 6 0
    3 1 0
    13 1 0 1
    4 13 0
    10 4 0 1
    0 9 0
    3 9 0 1
    5 11 0
    3 8 0
    3 10 0 1
    7 3 0
    12 8 0 1
    8 7 0
    11 13 0
    6 7 0 1
    5 1 0
    6 9 0
    10 12 0
    5 2 0 1
    2 7 0 1
    10 9 0 1
    1 4 0
    11 4 0
    13 12 0 1
    5 8 0
    11 1 0 1
    11 7 0 1
    9 4 0
    7 1 0
    5 7 0
    6 10 0
    3 5 0
    2 4 0
    4 11 0
    7 9 0 1
    0 1 0
    0 8 0
    13 3 0
    13 4 0 1
    13 11 0 1
    13 0 0 1
    8 11 0 1
    4 3 0 1
    7 12 0
    12 9 0
    8 2 0
    4 7 0
    12 13 0
    1 7 0 1
    9 7 0 1
    1 0 0
    8 12 0
    13 5 0
    11 6 0
    5 3 0 1
    4 2 0
    7 6 0 1
    10 0 0
    2 12 0 1
    4 9 0 1
    13 9 0 1
    2 6 0 1
    5 13 0
    6 4 0
    13 2 0 1
    8 5 0 1
    12 0 0
    0 7 0
    13 8 0 1
    13 6 0
    10 8 0 1
    10 2 0
    0 13 0 1
    3 12 0
    4 6 0
    10 13 0
    6 13 0 1
    6 3 0 1
    10 11 0
    2 3 0 1
    12 10 0 1
    11 12 0 1
    2 11 0 1
    5 12 0 1
    4 10 0
    11 5 0 1
    12 3 0 1
    6 8 0
    8 4 0 1
    9 3 0 1
    3 13 0 1
    0 6 0 1
    7 2 0 1
    2 13 0
    7 5 0
    0 10 0
    5 10 0
    5 0 0
    3 4 0
    9 10 0 1
    4 5 0
    1 11 0
    2 9 0 1
    12 4 0
    4 12 0 1
    8 3 0
    9 11 0
    6 1 0 1
    12 2 0
    10 7 0 1
    2 1 0
    6 12 0 1
    10 3 0 1
    0 4 0 1
    9 5 0
    3 11 0
    3 0 0
    7 11 0 1
    11 0 0
    6 2 0 1
    12 1 0
    6 5 0
    5 6 0 1
    9 12 0 1
    12 6 0
    7 8 0
    10 6 0
    8 1 0 1
    9 0 0
    10 1 0 1
    7 10 0 1
    9 1 0
    5 9 0 1
    0 3 0
    9 8 0 1
    10 5 0 1
    11 9 0 1
    0 2 0
    7 0 0
    4 1 0
    6 0 0 1
    4 8 0 1
    12 7 0
    5 4 0 1
    0 11 0
    0 12 0 1
    2 5 0
    3 2 0 1
    7 13 0
    1 13 0
    8 13 0 1
    1 12 0 1
    6 11 0
    2 10 0
    2 8 0 1
    9 2 0 1
    8 6 0 1
    12 11 0
    9 6 0
    0 5 0 1
    11 3 0 1
    1 10 0
    4 0 0 1
    2 0 0
    1 9 0
    3 7 0
    9 13 0
    8 0 0
    13 7 0 1
    8 10 0
    1 5 0
    12 5 0
    11 8 0
    1 8 0
    7 4 0
    3 6 0
    1 3 0
  • Virtual Link Traffic Requests = {(s,d,i):[(que,req,cap,type),...],...}
    Routing of Traffic Requests over Virtual Links
    {(Virtal Link):[(Traffic Request 1, Traffic Request 2, ...)], ...}
    {(source, destination, number): [(queue, request, capacity required, type), ...], ...}
    Virtual LinkTraffic Request
    sourcedestinationnumberqueuerequestcapacity requiredtype
    13 10 0 0 0 34.927 New
    11 2 0 0 1 34.692 New
    11 10 0 0 2 34.577 New
    8 9 0 0 3 34.510 New
    1 2 0 0 4 34.253 New
    1 180 5.355 Grm
    1 6 0 0 5 34.242 New
    3 1 0 0 6 34.179 New
    13 1 0 0 7 34.134 New
    4 13 0 0 8 33.784 New
    10 4 0 0 9 33.410 New
    0 9 0 0 10 33.309 New
    3 9 0 0 11 32.965 New
    1 174 5.731 Grm
    5 11 0 0 12 32.886 New
    3 8 0 0 13 32.882 New
    3 10 0 0 14 32.530 New
    7 3 0 0 15 32.280 New
    12 8 0 0 16 32.124 New
    1 163 7.773 Grm
    8 7 0 0 17 32.057 New
    11 13 0 0 18 31.968 New
    1 163 7.773 Grm
    6 7 0 0 19 31.776 New
    5 1 0 0 20 31.774 New
    1 164 7.615 Grm
    6 9 0 0 21 31.724 New
    10 12 0 0 22 31.202 New
    5 2 0 0 23 31.194 New
    2 7 0 0 24 30.975 New
    10 9 0 0 25 30.641 New
    1 4 0 0 26 30.614 New
    1 153 9.019 Grm
    11 4 0 0 27 30.485 New
    1 158 8.761 Grm
    13 12 0 0 28 30.433 New
    5 8 0 0 29 30.251 New
    11 1 0 0 30 30.229 New
    1 151 9.603 Grm
    11 7 0 0 31 30.070 New
    9 4 0 0 32 30.016 New
    1 154 8.977 Grm
    7 1 0 0 33 29.927 New
    1 172 5.815 Grm
    5 7 0 0 34 29.913 New
    1 160 8.095 Grm
    6 10 0 0 35 29.764 New
    1 162 7.941 Grm
    3 5 0 0 36 29.528 New
    1 147 10.165 Grm
    2 4 0 0 37 29.213 New
    1 145 10.516 Grm
    4 11 0 0 38 29.158 New
    1 149 9.926 Grm
    7 9 0 0 39 29.005 New
    1 148 10.158 Grm
    0 1 0 0 40 28.978 New
    1 156 8.902 Grm
    0 8 0 0 41 28.849 New
    1 157 8.872 Grm
    13 3 0 0 42 28.847 New
    1 166 7.403 Grm
    13 4 0 0 43 28.825 New
    1 155 8.925 Grm
    13 11 0 0 44 28.741 New
    13 0 0 0 45 28.603 New
    1 160 8.095 Grm
    8 11 0 0 46 28.586 New
    1 150 9.865 Grm
    4 3 0 0 47 28.558 New
    1 147 10.165 Grm
    7 12 0 0 48 28.555 New
    1 163 7.773 Grm
    12 9 0 0 49 28.470 New
    1 140 11.224 Grm
    8 2 0 0 50 28.299 New
    1 170 5.942 Grm
    4 7 0 0 51 28.173 New
    1 152 9.525 Grm
    12 13 0 0 52 28.126 New
    1 134 11.723 Grm
    1 7 0 0 53 28.089 New
    1 156 8.902 Grm
    9 7 0 0 54 27.922 New
    1 139 11.511 Grm
    1 0 0 0 55 27.886 New
    1 137 11.542 Grm
    8 12 0 0 56 27.812 New
    1 176 5.434 Grm
    13 5 0 0 57 27.588 New
    1 165 7.438 Grm
    11 6 0 0 58 27.490 New
    1 143 10.691 Grm
    5 3 0 0 59 27.380 New
    1 142 10.729 Grm
    4 2 0 0 60 27.245 New
    1 181 5.114 Grm
    7 6 0 0 61 27.134 New
    1 140 11.224 Grm
    10 0 0 0 62 27.036 New
    1 132 12.843 Grm
    2 12 0 0 63 26.956 New
    4 9 0 0 64 26.748 New
    13 9 0 0 65 26.167 New
    2 6 0 0 66 26.031 New
    1 126 13.729 Grm
    5 13 0 0 67 25.708 New
    1 125 13.921 Grm
    6 4 0 0 68 25.600 New
    1 128 13.607 Grm
    13 2 0 0 69 25.537 New
    8 5 0 0 70 25.481 New
    1 127 13.689 Grm
    12 0 0 0 71 25.440 New
    1 123 14.049 Grm
    0 7 0 0 72 25.417 New
    1 120 14.464 Grm
    13 8 0 0 73 25.215 New
    1 125 13.921 Grm
    13 6 0 0 74 24.980 New
    1 128 13.607 Grm
    10 8 0 0 75 24.855 New
    1 129 13.557 Grm
    10 2 0 0 76 24.743 New
    1 145 10.516 Grm
    0 13 0 0 77 24.583 New
    1 123 14.049 Grm
    3 12 0 0 78 24.472 New
    1 134 11.723 Grm
    4 6 0 0 79 24.465 New
    1 115 15.523 Grm
    10 13 0 0 80 24.043 New
    1 128 13.607 Grm
    6 13 0 0 81 24.006 New
    1 140 11.224 Grm
    6 3 0 0 82 23.828 New
    1 122 14.138 Grm
    10 11 0 0 83 23.731 New
    1 111 15.867 Grm
    2 3 0 0 84 23.637 New
    12 10 0 0 85 23.490 New
    1 111 15.867 Grm
    11 12 0 0 86 23.372 New
    2 11 0 0 87 23.368 New
    1 142 10.729 Grm
    1 180 5.355 Grm
    5 12 0 0 88 23.113 New
    4 10 0 0 89 23.098 New
    1 129 13.557 Grm
    11 5 0 0 90 22.355 New
    1 118 14.754 Grm
    12 3 0 0 91 22.353 New
    1 133 12.723 Grm
    6 8 0 0 92 22.101 New
    1 115 15.523 Grm
    8 4 0 0 93 22.069 New
    1 120 14.464 Grm
    9 3 0 0 94 21.812 New
    3 13 0 0 95 21.778 New
    1 112 15.710 Grm
    0 6 0 0 96 21.474 New
    7 2 0 0 97 21.425 New
    2 13 0 0 98 21.262 New
    1 106 17.542 Grm
    7 5 0 0 99 21.239 New
    1 125 13.921 Grm
    0 10 0 0 100 21.126 New
    1 135 11.722 Grm
    1 179 5.367 Grm
    5 10 0 0 101 21.096 New
    1 109 16.490 Grm
    5 0 0 0 102 21.052 New
    1 113 15.679 Grm
    3 4 0 0 103 20.666 New
    1 113 15.679 Grm
    9 10 0 0 104 20.662 New
    4 5 0 0 105 20.646 New
    1 113 15.679 Grm
    1 11 0 0 106 20.627 New
    1 110 16.357 Grm
    2 9 0 0 107 20.555 New
    1 103 18.795 Grm
    12 4 0 0 108 20.262 New
    1 115 15.523 Grm
    4 12 0 0 109 20.156 New
    1 106 17.542 Grm
    8 3 0 0 110 20.126 New
    1 138 11.521 Grm
    9 11 0 0 111 19.803 New
    1 133 12.723 Grm
    6 1 0 0 112 19.594 New
    1 106 17.542 Grm
    12 2 0 0 113 19.089 New
    1 92 20.407 Grm
    10 7 0 0 114 18.744 New
    1 94 20.125 Grm
    2 1 0 0 115 18.525 New
    1 92 20.407 Grm
    6 12 0 0 116 18.192 New
    1 92 20.407 Grm
    10 3 0 0 117 18.079 New
    1 88 21.436 Grm
    0 4 0 0 118 17.721 New
    1 99 19.476 Grm
    9 5 0 0 119 17.237 New
    1 119 14.520 Grm
    3 11 0 0 120 17.014 New
    1 122 14.138 Grm
    1 175 5.590 Grm
    3 0 0 0 121 16.747 New
    1 98 19.483 Grm
    7 11 0 0 122 16.710 New
    1 146 10.386 Grm
    1 158 8.761 Grm
    11 0 0 0 123 16.593 New
    1 99 19.476 Grm
    6 2 0 0 124 16.583 New
    1 83 22.212 Grm
    12 1 0 0 125 16.488 New
    1 73 23.112 Grm
    6 5 0 0 126 16.444 New
    1 80 22.299 Grm
    5 6 0 0 127 16.247 New
    1 104 18.229 Grm
    1 177 5.425 Grm
    9 12 0 0 128 15.920 New
    1 73 23.112 Grm
    12 6 0 0 129 15.891 New
    1 106 17.542 Grm
    1 171 5.843 Grm
    7 8 0 0 130 15.747 New
    1 105 18.122 Grm
    1 176 5.434 Grm
    10 6 0 0 131 15.516 New
    1 83 22.212 Grm
    8 1 0 0 132 15.407 New
    1 79 22.372 Grm
    9 0 0 0 133 15.179 New
    1 103 18.795 Grm
    1 173 5.756 Grm
    10 1 0 0 134 14.658 New
    1 66 24.566 Grm
    7 10 0 0 135 14.494 New
    1 84 22.092 Grm
    9 1 0 0 136 14.467 New
    1 63 24.854 Grm
    5 9 0 0 137 14.437 New
    1 63 24.854 Grm
    0 3 0 0 138 13.992 New
    1 62 24.887 Grm
    9 8 0 0 139 13.938 New
    1 79 22.372 Grm
    10 5 0 0 140 13.448 New
    1 84 22.092 Grm
    11 9 0 0 141 13.445 New
    1 53 25.857 Grm
    0 2 0 0 142 13.190 New
    1 47 26.443 Grm
    7 0 0 0 143 12.377 New
    1 39 27.590 Grm
    4 1 0 0 144 12.300 New
    1 94 20.125 Grm
    1 169 6.078 Grm
    6 0 0 0 145 11.910 New
    1 41 27.520 Grm
    4 8 0 0 146 11.487 New
    1 108 17.237 Grm
    12 7 0 0 147 11.392 New
    1 33 28.393 Grm
    5 4 0 0 148 11.203 New
    1 39 27.590 Grm
    0 11 0 0 149 11.165 New
    1 141 11.083 Grm
    1 168 6.223 Grm
    0 12 0 0 150 11.056 New
    1 41 27.520 Grm
    2 5 0 0 151 10.878 New
    1 95 19.860 Grm
    3 2 0 0 152 10.458 New
    1 95 19.860 Grm
    1 159 8.376 Grm
    7 13 0 0 153 10.357 New
    1 88 21.436 Grm
    1 160 8.095 Grm
    1 13 0 0 154 10.180 New
    1 73 23.112 Grm
    8 13 0 0 155 9.942 New
    1 21 30.028 Grm
    1 12 0 0 156 9.936 New
    1 66 24.566 Grm
    6 11 0 0 157 9.775 New
    1 53 25.857 Grm
    2 10 0 0 158 9.638 New
    1 104 18.229 Grm
    1 144 10.595 Grm
    2 8 0 0 159 9.596 New
    1 21 30.028 Grm
    9 2 0 0 160 9.403 New
    1 16 30.483 Grm
    8 6 0 0 161 9.307 New
    1 41 27.520 Grm
    12 11 0 0 162 9.302 New
    1 19 30.118 Grm
    9 6 0 0 163 9.215 New
    1 34 28.296 Grm
    0 5 0 0 164 9.178 New
    1 39 27.590 Grm
    11 3 0 0 165 8.909 New
    1 22 29.924 Grm
    1 10 0 0 166 8.812 New
    1 94 20.125 Grm
    4 0 0 0 167 8.748 New
    1 12 31.178 Grm
    2 0 0 0 168 8.515 New
    1 16 30.483 Grm
    1 9 0 0 169 8.067 New
    1 23 29.809 Grm
    3 7 0 0 170 7.901 New
    1 88 21.436 Grm
    9 13 0 0 171 7.400 New
    1 39 27.590 Grm
    8 0 0 0 172 6.818 New
    1 9 32.374 Grm
    13 7 0 0 173 6.702 New
    1 39 27.590 Grm
    8 10 0 0 174 6.560 New
    1 35 28.039 Grm
    1 5 0 0 175 6.378 New
    1 76 22.818 Grm
    12 5 0 0 176 6.217 New
    1 63 24.854 Grm
    1 160 8.095 Grm
    11 8 0 0 177 6.041 New
    1 9 32.374 Grm
    1 8 0 0 178 5.971 New
    1 92 20.407 Grm
    1 143 10.691 Grm
    7 4 0 0 179 5.474 New
    1 12 31.178 Grm
    3 6 0 0 180 5.338 New
    1 22 29.924 Grm
    1 3 0 0 181 5.227 New
    1 70 23.399 Grm
    1 151 9.603 Grm
    0 12 1 1 0 34.926 New
    13 8 1 1 1 34.820 New
    13 9 1 1 2 34.296 New
    8 4 1 1 3 34.291 New
    7 11 1 1 4 34.015 New
    12 3 1 1 5 32.899 New
    10 4 1 1 6 32.788 New
    8 6 1 1 7 32.642 New
    1 178 5.388 Grm
    10 8 1 1 8 32.479 New
    1 179 5.367 Grm
    2 12 1 1 10 32.246 New
    8 11 1 1 11 31.492 New
    1 163 7.773 Grm
    0 4 1 1 13 31.065 New
    4 3 1 1 14 30.752 New
    5 3 1 1 15 30.650 New
    3 13 1 1 17 30.282 New
    1 151 9.603 Grm
    8 1 1 1 18 30.205 New
    1 157 8.872 Grm
    7 9 1 1 20 30.096 New
    0 13 1 1 24 29.793 New
    2 8 1 1 25 29.530 New
    1 159 8.376 Grm
    7 10 1 1 26 29.452 New
    1 152 9.525 Grm
    7 2 1 1 27 29.346 New
    6 7 1 1 28 29.278 New
    9 2 1 1 29 29.097 New
    4 8 1 1 30 29.038 New
    1 178 5.388 Grm
    10 7 1 1 31 28.698 New
    1 146 10.386 Grm
    13 10 1 1 32 28.438 New
    12 10 1 1 36 27.872 New
    1 145 10.516 Grm
    2 7 1 1 37 27.771 New
    2 9 1 1 38 27.755 New
    1 154 8.977 Grm
    5 9 1 1 40 27.551 New
    1 173 5.756 Grm
    12 8 1 1 42 27.495 New
    1 136 11.709 Grm
    10 1 1 1 43 27.400 New
    4 9 1 1 44 27.381 New
    9 10 1 1 45 27.087 New
    10 9 1 1 46 27.053 New
    9 8 1 1 48 26.269 New
    1 150 9.865 Grm
    5 4 1 1 49 26.255 New
    1 129 13.557 Grm
    9 12 1 1 50 26.131 New
    1 174 5.731 Grm
    5 12 1 1 51 26.022 New
    1 133 12.723 Grm
    9 7 1 1 52 26.002 New
    1 140 11.224 Grm
    5 2 1 1 54 25.642 New
    1 127 13.689 Grm
    6 1 1 1 55 25.614 New
    1 143 10.691 Grm
    0 6 1 1 56 25.539 New
    1 132 12.843 Grm
    11 9 1 1 57 25.534 New
    1 141 11.083 Grm
    2 6 1 1 58 25.529 New
    1 127 13.689 Grm
    13 1 1 1 59 25.479 New
    1 134 11.723 Grm
    13 11 1 1 60 24.927 New
    1 118 14.754 Grm
    11 12 1 1 61 24.895 New
    4 0 1 1 64 24.736 New
    1 120 14.464 Grm
    9 3 1 1 65 24.628 New
    1 148 10.158 Grm
    6 2 1 1 67 24.514 New
    1 171 5.843 Grm
    2 11 1 1 68 24.083 New
    1 114 15.655 Grm
    4 12 1 1 69 23.906 New
    11 7 1 1 71 23.399 New
    1 111 15.867 Grm
    6 13 1 1 72 23.393 New
    1 155 8.925 Grm
    1 177 5.425 Grm
    11 1 1 1 74 23.021 New
    1 133 12.723 Grm
    6 3 1 1 75 22.947 New
    11 5 1 1 77 22.667 New
    1 114 15.655 Grm
    2 3 1 1 78 22.619 New
    11 10 1 1 81 22.283 New
    1 110 16.357 Grm
    13 4 1 1 82 22.240 New
    1 106 17.542 Grm
    1 12 1 1 85 22.079 New
    1 123 14.049 Grm
    11 3 1 1 86 22.011 New
    1 112 15.710 Grm
    8 9 1 1 87 21.641 New
    1 115 15.523 Grm
    1 2 1 1 89 21.077 New
    1 104 18.229 Grm
    6 0 1 1 90 21.056 New
    1 127 13.689 Grm
    13 2 1 1 91 20.525 New
    1 112 15.710 Grm
    8 13 1 1 93 20.270 New
    1 108 17.237 Grm
    3 10 1 1 96 19.744 New
    1 128 13.607 Grm
    0 5 1 1 97 19.497 New
    10 3 1 1 100 19.468 New
    1 113 15.679 Grm
    7 6 1 1 101 19.464 New
    1 111 15.867 Grm
    10 5 1 1 102 19.406 New
    1 104 18.229 Grm
    6 12 1 1 107 17.360 New
    3 2 1 1 116 15.335 New
    1 126 13.729 Grm
    1 142 10.729 Grm
    13 12 1 1 117 15.236 New
    13 7 1 1 121 14.151 New
    1 7 1 1 124 13.927 New
    1 125 13.921 Grm
    1 164 7.615 Grm
    8 5 1 1 130 13.044 New
    1 136 11.709 Grm
    3 9 1 1 131 12.885 New
    1 133 12.723 Grm
    1 139 11.511 Grm
    5 6 1 1 161 7.960 New
    1 165 7.438 Grm
    13 0 1 1 167 6.644 New
  • Virtual Link Totals = {(s,d,i):[caputil, capfree, num_of_TReqs],...}
    virtual link src,dst cap utilised, cap free, num of traffic requests
    source (s) destination (d) number (n)
    13 10 0 34.927 5.073 1.000
    11 2 0 34.692 5.308 1.000
    11 10 0 34.577 5.423 1.000
    8 9 0 34.510 5.490 1.000
    1 2 0 39.608 0.392 2.000
    1 6 0 34.242 5.758 1.000
    3 1 0 34.179 5.821 1.000
    13 1 0 34.134 5.866 1.000
    4 13 0 33.784 6.216 1.000
    10 4 0 33.410 6.590 1.000
    0 9 0 33.309 6.691 1.000
    3 9 0 38.696 1.304 2.000
    5 11 0 32.886 7.114 1.000
    3 8 0 32.882 7.118 1.000
    3 10 0 32.530 7.470 1.000
    7 3 0 32.280 7.720 1.000
    12 8 0 39.897 0.103 2.000
    8 7 0 32.057 7.943 1.000
    11 13 0 39.741 0.259 2.000
    6 7 0 31.776 8.224 1.000
    5 1 0 39.389 0.611 2.000
    6 9 0 31.724 8.276 1.000
    10 12 0 31.202 8.798 1.000
    5 2 0 31.194 8.806 1.000
    2 7 0 30.975 9.025 1.000
    10 9 0 30.641 9.359 1.000
    1 4 0 39.633 0.367 2.000
    11 4 0 39.246 0.754 2.000
    13 12 0 30.433 9.567 1.000
    5 8 0 30.251 9.749 1.000
    11 1 0 39.832 0.168 2.000
    11 7 0 30.070 9.930 1.000
    9 4 0 38.993 1.007 2.000
    7 1 0 35.742 4.258 2.000
    5 7 0 38.008 1.992 2.000
    6 10 0 37.705 2.295 2.000
    3 5 0 39.693 0.307 2.000
    2 4 0 39.729 0.271 2.000
    4 11 0 39.084 0.916 2.000
    7 9 0 39.163 0.837 2.000
    0 1 0 37.880 2.120 2.000
    0 8 0 37.721 2.279 2.000
    13 3 0 36.250 3.750 2.000
    13 4 0 37.750 2.250 2.000
    13 11 0 28.741 11.259 1.000
    13 0 0 36.698 3.302 2.000
    8 11 0 38.451 1.549 2.000
    4 3 0 38.723 1.277 2.000
    7 12 0 36.328 3.672 2.000
    12 9 0 39.694 0.306 2.000
    8 2 0 34.241 5.759 2.000
    4 7 0 37.698 2.302 2.000
    12 13 0 39.849 0.151 2.000
    1 7 0 36.991 3.009 2.000
    9 7 0 39.433 0.567 2.000
    1 0 0 39.428 0.572 2.000
    8 12 0 33.246 6.754 2.000
    13 5 0 35.026 4.974 2.000
    11 6 0 38.181 1.819 2.000
    5 3 0 38.109 1.891 2.000
    4 2 0 32.359 7.641 2.000
    7 6 0 38.358 1.642 2.000
    10 0 0 39.879 0.121 2.000
    2 12 0 26.956 13.044 1.000
    4 9 0 26.748 13.252 1.000
    13 9 0 26.167 13.833 1.000
    2 6 0 39.760 0.240 2.000
    5 13 0 39.629 0.371 2.000
    6 4 0 39.207 0.793 2.000
    13 2 0 25.537 14.463 1.000
    8 5 0 39.170 0.830 2.000
    12 0 0 39.489 0.511 2.000
    0 7 0 39.881 0.119 2.000
    13 8 0 39.136 0.864 2.000
    13 6 0 38.587 1.413 2.000
    10 8 0 38.412 1.588 2.000
    10 2 0 35.259 4.741 2.000
    0 13 0 38.632 1.368 2.000
    3 12 0 36.195 3.805 2.000
    4 6 0 39.988 0.012 2.000
    10 13 0 37.650 2.350 2.000
    6 13 0 35.230 4.770 2.000
    6 3 0 37.966 2.034 2.000
    10 11 0 39.598 0.402 2.000
    2 3 0 23.637 16.363 1.000
    12 10 0 39.357 0.643 2.000
    11 12 0 23.372 16.628 1.000
    2 11 0 39.452 0.548 3.000
    5 12 0 23.113 16.887 1.000
    4 10 0 36.655 3.345 2.000
    11 5 0 37.109 2.891 2.000
    12 3 0 35.076 4.924 2.000
    6 8 0 37.624 2.376 2.000
    8 4 0 36.533 3.467 2.000
    9 3 0 21.812 18.188 1.000
    3 13 0 37.488 2.512 2.000
    0 6 0 21.474 18.526 1.000
    7 2 0 21.425 18.575 1.000
    2 13 0 38.804 1.196 2.000
    7 5 0 35.160 4.840 2.000
    0 10 0 38.215 1.785 3.000
    5 10 0 37.586 2.414 2.000
    5 0 0 36.731 3.269 2.000
    3 4 0 36.345 3.655 2.000
    9 10 0 20.662 19.338 1.000
    4 5 0 36.325 3.675 2.000
    1 11 0 36.984 3.016 2.000
    2 9 0 39.350 0.650 2.000
    12 4 0 35.785 4.215 2.000
    4 12 0 37.698 2.302 2.000
    8 3 0 31.647 8.353 2.000
    9 11 0 32.526 7.474 2.000
    6 1 0 37.136 2.864 2.000
    12 2 0 39.496 0.504 2.000
    10 7 0 38.869 1.131 2.000
    2 1 0 38.932 1.068 2.000
    6 12 0 38.599 1.401 2.000
    10 3 0 39.515 0.485 2.000
    0 4 0 37.197 2.803 2.000
    9 5 0 31.757 8.243 2.000
    3 11 0 36.742 3.258 3.000
    3 0 0 36.230 3.770 2.000
    7 11 0 35.857 4.143 3.000
    11 0 0 36.069 3.931 2.000
    6 2 0 38.795 1.205 2.000
    12 1 0 39.600 0.400 2.000
    6 5 0 38.743 1.257 2.000
    5 6 0 39.901 0.099 3.000
    9 12 0 39.032 0.968 2.000
    12 6 0 39.276 0.724 3.000
    7 8 0 39.303 0.697 3.000
    10 6 0 37.728 2.272 2.000
    8 1 0 37.779 2.221 2.000
    9 0 0 39.730 0.270 3.000
    10 1 0 39.224 0.776 2.000
    7 10 0 36.586 3.414 2.000
    9 1 0 39.321 0.679 2.000
    5 9 0 39.291 0.709 2.000
    0 3 0 38.879 1.121 2.000
    9 8 0 36.310 3.690 2.000
    10 5 0 35.540 4.460 2.000
    11 9 0 39.302 0.698 2.000
    0 2 0 39.633 0.367 2.000
    7 0 0 39.967 0.033 2.000
    4 1 0 38.503 1.497 3.000
    6 0 0 39.430 0.570 2.000
    4 8 0 28.724 11.276 2.000
    12 7 0 39.785 0.215 2.000
    5 4 0 38.793 1.207 2.000
    0 11 0 28.471 11.529 3.000
    0 12 0 38.576 1.424 2.000
    2 5 0 30.738 9.262 2.000
    3 2 0 38.694 1.306 3.000
    7 13 0 39.888 0.112 3.000
    1 13 0 33.292 6.708 2.000
    8 13 0 39.970 0.030 2.000
    1 12 0 34.502 5.498 2.000
    6 11 0 35.632 4.368 2.000
    2 10 0 38.462 1.538 3.000
    2 8 0 39.624 0.376 2.000
    9 2 0 39.886 0.114 2.000
    8 6 0 36.827 3.173 2.000
    12 11 0 39.420 0.580 2.000
    9 6 0 37.511 2.489 2.000
    0 5 0 36.768 3.232 2.000
    11 3 0 38.833 1.167 2.000
    1 10 0 28.937 11.063 2.000
    4 0 0 39.926 0.074 2.000
    2 0 0 38.998 1.002 2.000
    1 9 0 37.876 2.124 2.000
    3 7 0 29.337 10.663 2.000
    9 13 0 34.990 5.010 2.000
    8 0 0 39.192 0.808 2.000
    13 7 0 34.292 5.708 2.000
    8 10 0 34.599 5.401 2.000
    1 5 0 29.196 10.804 2.000
    12 5 0 39.166 0.834 3.000
    11 8 0 38.415 1.585 2.000
    1 8 0 37.069 2.931 3.000
    7 4 0 36.652 3.348 2.000
    3 6 0 35.262 4.738 2.000
    1 3 0 38.229 1.771 3.000
    0 12 1 34.926 5.074 1.000
    13 8 1 34.820 5.180 1.000
    13 9 1 34.296 5.704 1.000
    8 4 1 34.291 5.709 1.000
    7 11 1 34.015 5.985 1.000
    12 3 1 32.899 7.101 1.000
    10 4 1 32.788 7.212 1.000
    8 6 1 38.030 1.970 2.000
    10 8 1 37.846 2.154 2.000
    2 12 1 32.246 7.754 1.000
    8 11 1 39.265 0.735 2.000
    0 4 1 31.065 8.935 1.000
    4 3 1 30.752 9.248 1.000
    5 3 1 30.650 9.350 1.000
    3 13 1 39.885 0.115 2.000
    8 1 1 39.077 0.923 2.000
    7 9 1 30.096 9.904 1.000
    0 13 1 29.793 10.207 1.000
    2 8 1 37.906 2.094 2.000
    7 10 1 38.977 1.023 2.000
    7 2 1 29.346 10.654 1.000
    6 7 1 29.278 10.722 1.000
    9 2 1 29.097 10.903 1.000
    4 8 1 34.426 5.574 2.000
    10 7 1 39.084 0.916 2.000
    13 10 1 28.438 11.562 1.000
    12 10 1 38.388 1.612 2.000
    2 7 1 27.771 12.229 1.000
    2 9 1 36.732 3.268 2.000
    5 9 1 33.307 6.693 2.000
    12 8 1 39.204 0.796 2.000
    10 1 1 27.400 12.600 1.000
    4 9 1 27.381 12.619 1.000
    9 10 1 27.087 12.913 1.000
    10 9 1 27.053 12.947 1.000
    9 8 1 36.134 3.866 2.000
    5 4 1 39.812 0.188 2.000
    9 12 1 31.862 8.138 2.000
    5 12 1 38.745 1.255 2.000
    9 7 1 37.226 2.774 2.000
    5 2 1 39.331 0.669 2.000
    6 1 1 36.305 3.695 2.000
    0 6 1 38.382 1.618 2.000
    11 9 1 36.617 3.383 2.000
    2 6 1 39.218 0.782 2.000
    13 1 1 37.202 2.798 2.000
    13 11 1 39.681 0.319 2.000
    11 12 1 24.895 15.105 1.000
    4 0 1 39.200 0.800 2.000
    9 3 1 34.786 5.214 2.000
    6 2 1 30.357 9.643 2.000
    2 11 1 39.738 0.262 2.000
    4 12 1 23.906 16.094 1.000
    11 7 1 39.266 0.734 2.000
    6 13 1 37.743 2.257 3.000
    11 1 1 35.744 4.256 2.000
    6 3 1 22.947 17.053 1.000
    11 5 1 38.322 1.678 2.000
    2 3 1 22.619 17.381 1.000
    11 10 1 38.640 1.360 2.000
    13 4 1 39.782 0.218 2.000
    1 12 1 36.128 3.872 2.000
    11 3 1 37.721 2.279 2.000
    8 9 1 37.164 2.836 2.000
    1 2 1 39.306 0.694 2.000
    6 0 1 34.745 5.255 2.000
    13 2 1 36.235 3.765 2.000
    8 13 1 37.507 2.493 2.000
    3 10 1 33.351 6.649 2.000
    0 5 1 19.497 20.503 1.000
    10 3 1 35.147 4.853 2.000
    7 6 1 35.331 4.669 2.000
    10 5 1 37.635 2.365 2.000
    6 12 1 17.360 22.640 1.000
    3 2 1 39.793 0.207 3.000
    13 12 1 15.236 24.764 1.000
    13 7 1 14.151 25.849 1.000
    1 7 1 35.463 4.537 3.000
    8 5 1 24.753 15.247 2.000
    3 9 1 37.119 2.881 3.000
    5 6 1 15.398 24.602 2.000
    13 0 1 6.644 33.356 1.000
  • The virtual topology for routing over physical topology
    source→destination source (s)destination (d)number (n)capacity
    Node13 → Node10 13 10 0 34.927
    Node11 → Node2 11 2 0 34.692
    Node11 → Node10 11 10 0 34.577
    Node8 → Node9 8 9 0 34.51
    Node1 → Node2 1 2 0 39.608
    Node1 → Node6 1 6 0 34.242
    Node3 → Node1 3 1 0 34.179
    Node13 → Node1 13 1 0 34.134
    Node4 → Node13 4 13 0 33.784
    Node10 → Node4 10 4 0 33.41
    Node0 → Node9 0 9 0 33.309
    Node3 → Node9 3 9 0 38.696
    Node5 → Node11 5 11 0 32.886
    Node3 → Node8 3 8 0 32.882
    Node3 → Node10 3 10 0 32.53
    Node7 → Node3 7 3 0 32.28
    Node12 → Node8 12 8 0 39.897
    Node8 → Node7 8 7 0 32.057
    Node11 → Node13 11 13 0 39.741
    Node6 → Node7 6 7 0 31.776
    Node5 → Node1 5 1 0 39.389
    Node6 → Node9 6 9 0 31.724
    Node10 → Node12 10 12 0 31.202
    Node5 → Node2 5 2 0 31.194
    Node2 → Node7 2 7 0 30.975
    Node10 → Node9 10 9 0 30.641
    Node1 → Node4 1 4 0 39.633
    Node11 → Node4 11 4 0 39.246
    Node13 → Node12 13 12 0 30.433
    Node5 → Node8 5 8 0 30.251
    Node11 → Node1 11 1 0 39.832
    Node11 → Node7 11 7 0 30.07
    Node9 → Node4 9 4 0 38.993
    Node7 → Node1 7 1 0 35.742
    Node5 → Node7 5 7 0 38.008
    Node6 → Node10 6 10 0 37.705
    Node3 → Node5 3 5 0 39.693
    Node2 → Node4 2 4 0 39.729
    Node4 → Node11 4 11 0 39.084
    Node7 → Node9 7 9 0 39.163
    Node0 → Node1 0 1 0 37.88
    Node0 → Node8 0 8 0 37.721
    Node13 → Node3 13 3 0 36.25
    Node13 → Node4 13 4 0 37.75
    Node13 → Node11 13 11 0 28.741
    Node13 → Node0 13 0 0 36.698
    Node8 → Node11 8 11 0 38.451
    Node4 → Node3 4 3 0 38.723
    Node7 → Node12 7 12 0 36.328
    Node12 → Node9 12 9 0 39.694
    Node8 → Node2 8 2 0 34.241
    Node4 → Node7 4 7 0 37.698
    Node12 → Node13 12 13 0 39.849
    Node1 → Node7 1 7 0 36.991
    Node9 → Node7 9 7 0 39.433
    Node1 → Node0 1 0 0 39.428
    Node8 → Node12 8 12 0 33.246
    Node13 → Node5 13 5 0 35.026
    Node11 → Node6 11 6 0 38.181
    Node5 → Node3 5 3 0 38.109
    Node4 → Node2 4 2 0 32.359
    Node7 → Node6 7 6 0 38.358
    Node10 → Node0 10 0 0 39.879
    Node2 → Node12 2 12 0 26.956
    Node4 → Node9 4 9 0 26.748
    Node13 → Node9 13 9 0 26.167
    Node2 → Node6 2 6 0 39.76
    Node5 → Node13 5 13 0 39.629
    Node6 → Node4 6 4 0 39.207
    Node13 → Node2 13 2 0 25.537
    Node8 → Node5 8 5 0 39.17
    Node12 → Node0 12 0 0 39.489
    Node0 → Node7 0 7 0 39.881
    Node13 → Node8 13 8 0 39.136
    Node13 → Node6 13 6 0 38.587
    Node10 → Node8 10 8 0 38.412
    Node10 → Node2 10 2 0 35.259
    Node0 → Node13 0 13 0 38.632
    Node3 → Node12 3 12 0 36.195
    Node4 → Node6 4 6 0 39.988
    Node10 → Node13 10 13 0 37.65
    Node6 → Node13 6 13 0 35.23
    Node6 → Node3 6 3 0 37.966
    Node10 → Node11 10 11 0 39.598
    Node2 → Node3 2 3 0 23.637
    Node12 → Node10 12 10 0 39.357
    Node11 → Node12 11 12 0 23.372
    Node2 → Node11 2 11 0 39.452
    Node5 → Node12 5 12 0 23.113
    Node4 → Node10 4 10 0 36.655
    Node11 → Node5 11 5 0 37.109
    Node12 → Node3 12 3 0 35.076
    Node6 → Node8 6 8 0 37.624
    Node8 → Node4 8 4 0 36.533
    Node9 → Node3 9 3 0 21.812
    Node3 → Node13 3 13 0 37.488
    Node0 → Node6 0 6 0 21.474
    Node7 → Node2 7 2 0 21.425
    Node2 → Node13 2 13 0 38.804
    Node7 → Node5 7 5 0 35.16
    Node0 → Node10 0 10 0 38.215
    Node5 → Node10 5 10 0 37.586
    Node5 → Node0 5 0 0 36.731
    Node3 → Node4 3 4 0 36.345
    Node9 → Node10 9 10 0 20.662
    Node4 → Node5 4 5 0 36.325
    Node1 → Node11 1 11 0 36.984
    Node2 → Node9 2 9 0 39.35
    Node12 → Node4 12 4 0 35.785
    Node4 → Node12 4 12 0 37.698
    Node8 → Node3 8 3 0 31.647
    Node9 → Node11 9 11 0 32.526
    Node6 → Node1 6 1 0 37.136
    Node12 → Node2 12 2 0 39.496
    Node10 → Node7 10 7 0 38.869
    Node2 → Node1 2 1 0 38.932
    Node6 → Node12 6 12 0 38.599
    Node10 → Node3 10 3 0 39.515
    Node0 → Node4 0 4 0 37.197
    Node9 → Node5 9 5 0 31.757
    Node3 → Node11 3 11 0 36.742
    Node3 → Node0 3 0 0 36.23
    Node7 → Node11 7 11 0 35.857
    Node11 → Node0 11 0 0 36.069
    Node6 → Node2 6 2 0 38.795
    Node12 → Node1 12 1 0 39.6
    Node6 → Node5 6 5 0 38.743
    Node5 → Node6 5 6 0 39.901
    Node9 → Node12 9 12 0 39.032
    Node12 → Node6 12 6 0 39.276
    Node7 → Node8 7 8 0 39.303
    Node10 → Node6 10 6 0 37.728
    Node8 → Node1 8 1 0 37.779
    Node9 → Node0 9 0 0 39.73
    Node10 → Node1 10 1 0 39.224
    Node7 → Node10 7 10 0 36.586
    Node9 → Node1 9 1 0 39.321
    Node5 → Node9 5 9 0 39.291
    Node0 → Node3 0 3 0 38.879
    Node9 → Node8 9 8 0 36.31
    Node10 → Node5 10 5 0 35.54
    Node11 → Node9 11 9 0 39.302
    Node0 → Node2 0 2 0 39.633
    Node7 → Node0 7 0 0 39.967
    Node4 → Node1 4 1 0 38.503
    Node6 → Node0 6 0 0 39.43
    Node4 → Node8 4 8 0 28.724
    Node12 → Node7 12 7 0 39.785
    Node5 → Node4 5 4 0 38.793
    Node0 → Node11 0 11 0 28.471
    Node0 → Node12 0 12 0 38.576
    Node2 → Node5 2 5 0 30.738
    Node3 → Node2 3 2 0 38.694
    Node7 → Node13 7 13 0 39.888
    Node1 → Node13 1 13 0 33.292
    Node8 → Node13 8 13 0 39.97
    Node1 → Node12 1 12 0 34.502
    Node6 → Node11 6 11 0 35.632
    Node2 → Node10 2 10 0 38.462
    Node2 → Node8 2 8 0 39.624
    Node9 → Node2 9 2 0 39.886
    Node8 → Node6 8 6 0 36.827
    Node12 → Node11 12 11 0 39.42
    Node9 → Node6 9 6 0 37.511
    Node0 → Node5 0 5 0 36.768
    Node11 → Node3 11 3 0 38.833
    Node1 → Node10 1 10 0 28.937
    Node4 → Node0 4 0 0 39.926
    Node2 → Node0 2 0 0 38.998
    Node1 → Node9 1 9 0 37.876
    Node3 → Node7 3 7 0 29.337
    Node9 → Node13 9 13 0 34.99
    Node8 → Node0 8 0 0 39.192
    Node13 → Node7 13 7 0 34.292
    Node8 → Node10 8 10 0 34.599
    Node1 → Node5 1 5 0 29.196
    Node12 → Node5 12 5 0 39.166
    Node11 → Node8 11 8 0 38.415
    Node1 → Node8 1 8 0 37.069
    Node7 → Node4 7 4 0 36.652
    Node3 → Node6 3 6 0 35.262
    Node1 → Node3 1 3 0 38.229
    Node0 → Node12 0 12 1 34.926
    Node13 → Node8 13 8 1 34.82
    Node13 → Node9 13 9 1 34.296
    Node8 → Node4 8 4 1 34.291
    Node7 → Node11 7 11 1 34.015
    Node12 → Node3 12 3 1 32.899
    Node10 → Node4 10 4 1 32.788
    Node8 → Node6 8 6 1 38.03
    Node10 → Node8 10 8 1 37.846
    Node2 → Node12 2 12 1 32.246
    Node8 → Node11 8 11 1 39.265
    Node0 → Node4 0 4 1 31.065
    Node4 → Node3 4 3 1 30.752
    Node5 → Node3 5 3 1 30.65
    Node3 → Node13 3 13 1 39.885
    Node8 → Node1 8 1 1 39.077
    Node7 → Node9 7 9 1 30.096
    Node0 → Node13 0 13 1 29.793
    Node2 → Node8 2 8 1 37.906
    Node7 → Node10 7 10 1 38.977
    Node7 → Node2 7 2 1 29.346
    Node6 → Node7 6 7 1 29.278
    Node9 → Node2 9 2 1 29.097
    Node4 → Node8 4 8 1 34.426
    Node10 → Node7 10 7 1 39.084
    Node13 → Node10 13 10 1 28.438
    Node12 → Node10 12 10 1 38.388
    Node2 → Node7 2 7 1 27.771
    Node2 → Node9 2 9 1 36.732
    Node5 → Node9 5 9 1 33.307
    Node12 → Node8 12 8 1 39.204
    Node10 → Node1 10 1 1 27.4
    Node4 → Node9 4 9 1 27.381
    Node9 → Node10 9 10 1 27.087
    Node10 → Node9 10 9 1 27.053
    Node9 → Node8 9 8 1 36.134
    Node5 → Node4 5 4 1 39.812
    Node9 → Node12 9 12 1 31.862
    Node5 → Node12 5 12 1 38.745
    Node9 → Node7 9 7 1 37.226
    Node5 → Node2 5 2 1 39.331
    Node6 → Node1 6 1 1 36.305
    Node0 → Node6 0 6 1 38.382
    Node11 → Node9 11 9 1 36.617
    Node2 → Node6 2 6 1 39.218
    Node13 → Node1 13 1 1 37.202
    Node13 → Node11 13 11 1 39.681
    Node11 → Node12 11 12 1 24.895
    Node4 → Node0 4 0 1 39.2
    Node9 → Node3 9 3 1 34.786
    Node6 → Node2 6 2 1 30.357
    Node2 → Node11 2 11 1 39.738
    Node4 → Node12 4 12 1 23.906
    Node11 → Node7 11 7 1 39.266
    Node6 → Node13 6 13 1 37.743
    Node11 → Node1 11 1 1 35.744
    Node6 → Node3 6 3 1 22.947
    Node11 → Node5 11 5 1 38.322
    Node2 → Node3 2 3 1 22.619
    Node11 → Node10 11 10 1 38.64
    Node13 → Node4 13 4 1 39.782
    Node1 → Node12 1 12 1 36.128
    Node11 → Node3 11 3 1 37.721
    Node8 → Node9 8 9 1 37.164
    Node1 → Node2 1 2 1 39.306
    Node6 → Node0 6 0 1 34.745
    Node13 → Node2 13 2 1 36.235
    Node8 → Node13 8 13 1 37.507
    Node3 → Node10 3 10 1 33.351
    Node0 → Node5 0 5 1 19.497
    Node10 → Node3 10 3 1 35.147
    Node7 → Node6 7 6 1 35.331
    Node10 → Node5 10 5 1 37.635
    Node6 → Node12 6 12 1 17.36
    Node3 → Node2 3 2 1 39.793
    Node13 → Node12 13 12 1 15.236
    Node13 → Node7 13 7 1 14.151
    Node1 → Node7 1 7 1 35.463
    Node8 → Node5 8 5 1 24.753
    Node3 → Node9 3 9 1 37.119
    Node5 → Node6 5 6 1 15.398
    Node13 → Node0 13 0 1 6.644
    Cij: number of wavelength channels on the virtual topology between node pair (i,j)
    Virtual linknumber of wavelengths
    Node13 → Node10 2
    Node11 → Node2 1
    Node11 → Node10 2
    Node8 → Node9 2
    Node1 → Node2 2
    Node1 → Node6 1
    Node3 → Node1 1
    Node13 → Node1 2
    Node4 → Node13 1
    Node10 → Node4 2
    Node0 → Node9 1
    Node3 → Node9 2
    Node5 → Node11 1
    Node3 → Node8 1
    Node3 → Node10 2
    Node7 → Node3 1
    Node12 → Node8 2
    Node8 → Node7 1
    Node11 → Node13 1
    Node6 → Node7 2
    Node5 → Node1 1
    Node6 → Node9 1
    Node10 → Node12 1
    Node5 → Node2 2
    Node2 → Node7 2
    Node10 → Node9 2
    Node1 → Node4 1
    Node11 → Node4 1
    Node13 → Node12 2
    Node5 → Node8 1
    Node11 → Node1 2
    Node11 → Node7 2
    Node9 → Node4 1
    Node7 → Node1 1
    Node5 → Node7 1
    Node6 → Node10 1
    Node3 → Node5 1
    Node2 → Node4 1
    Node4 → Node11 1
    Node7 → Node9 2
    Node0 → Node1 1
    Node0 → Node8 1
    Node13 → Node3 1
    Node13 → Node4 2
    Node13 → Node11 2
    Node13 → Node0 2
    Node8 → Node11 2
    Node4 → Node3 2
    Node7 → Node12 1
    Node12 → Node9 1
    Node8 → Node2 1
    Node4 → Node7 1
    Node12 → Node13 1
    Node1 → Node7 2
    Node9 → Node7 2
    Node1 → Node0 1
    Node8 → Node12 1
    Node13 → Node5 1
    Node11 → Node6 1
    Node5 → Node3 2
    Node4 → Node2 1
    Node7 → Node6 2
    Node10 → Node0 1
    Node2 → Node12 2
    Node4 → Node9 2
    Node13 → Node9 2
    Node2 → Node6 2
    Node5 → Node13 1
    Node6 → Node4 1
    Node13 → Node2 2
    Node8 → Node5 2
    Node12 → Node0 1
    Node0 → Node7 1
    Node13 → Node8 2
    Node13 → Node6 1
    Node10 → Node8 2
    Node10 → Node2 1
    Node0 → Node13 2
    Node3 → Node12 1
    Node4 → Node6 1
    Node10 → Node13 1
    Node6 → Node13 2
    Node6 → Node3 2
    Node10 → Node11 1
    Node2 → Node3 2
    Node12 → Node10 2
    Node11 → Node12 2
    Node2 → Node11 2
    Node5 → Node12 2
    Node4 → Node10 1
    Node11 → Node5 2
    Node12 → Node3 2
    Node6 → Node8 1
    Node8 → Node4 2
    Node9 → Node3 2
    Node3 → Node13 2
    Node0 → Node6 2
    Node7 → Node2 2
    Node2 → Node13 1
    Node7 → Node5 1
    Node0 → Node10 1
    Node5 → Node10 1
    Node5 → Node0 1
    Node3 → Node4 1
    Node9 → Node10 2
    Node4 → Node5 1
    Node1 → Node11 1
    Node2 → Node9 2
    Node12 → Node4 1
    Node4 → Node12 2
    Node8 → Node3 1
    Node9 → Node11 1
    Node6 → Node1 2
    Node12 → Node2 1
    Node10 → Node7 2
    Node2 → Node1 1
    Node6 → Node12 2
    Node10 → Node3 2
    Node0 → Node4 2
    Node9 → Node5 1
    Node3 → Node11 1
    Node3 → Node0 1
    Node7 → Node11 2
    Node11 → Node0 1
    Node6 → Node2 2
    Node12 → Node1 1
    Node6 → Node5 1
    Node5 → Node6 2
    Node9 → Node12 2
    Node12 → Node6 1
    Node7 → Node8 1
    Node10 → Node6 1
    Node8 → Node1 2
    Node9 → Node0 1
    Node10 → Node1 2
    Node7 → Node10 2
    Node9 → Node1 1
    Node5 → Node9 2
    Node0 → Node3 1
    Node9 → Node8 2
    Node10 → Node5 2
    Node11 → Node9 2
    Node0 → Node2 1
    Node7 → Node0 1
    Node4 → Node1 1
    Node6 → Node0 2
    Node4 → Node8 2
    Node12 → Node7 1
    Node5 → Node4 2
    Node0 → Node11 1
    Node0 → Node12 2
    Node2 → Node5 1
    Node3 → Node2 2
    Node7 → Node13 1
    Node1 → Node13 1
    Node8 → Node13 2
    Node1 → Node12 2
    Node6 → Node11 1
    Node2 → Node10 1
    Node2 → Node8 2
    Node9 → Node2 2
    Node8 → Node6 2
    Node12 → Node11 1
    Node9 → Node6 1
    Node0 → Node5 2
    Node11 → Node3 2
    Node1 → Node10 1
    Node4 → Node0 2
    Node2 → Node0 1
    Node1 → Node9 1
    Node3 → Node7 1
    Node9 → Node13 1
    Node8 → Node0 1
    Node13 → Node7 2
    Node8 → Node10 1
    Node1 → Node5 1
    Node12 → Node5 1
    Node11 → Node8 1
    Node1 → Node8 1
    Node7 → Node4 1
    Node3 → Node6 1
    Node1 → Node3 1
    ∑ Cij: number of wavelength channels on the virtual topology starting from node i
    Nodenumber of wavelengths
    Node13 23
    Node11 20
    Node8 20
    Node1 16
    Node3 17
    Node4 18
    Node10 20
    Node0 18
    Node5 19
    Node7 18
    Node12 16
    Node6 20
    Node2 20
    Node9 19
    Routing virtual (lightpath) links over the Physical Topology in the optical layer
    StepVirtual LinkUtilised capacityFree capacityShortest pathPhysical Link(s)Distance (km)WavelengthsWavelength ID
    (source,destination,fiber,wavelength)
    TypeNode
    1 Node13→Node10
    (13,10,0)
    34.927 5.073 Shortest path: [Node13, Node10]

    Shortest path: [13, 10]
    Link 19 : Node13→Node10 684.0 1
  • Appended the Physical Link: (13, 10, 0, 0) to the Virtual Link's (13, 10, 0) routing over the physical topology.
  • Source Node13
    -- 0 no wavelength id Destination Node10
    2 Node11→Node2
    (11,2,0)
    34.692 5.308 Shortest path: [Node11, Node8, Node7, Node6, Node4, Node5, Node2]

    Shortest path: [11, 8, 7, 6, 4, 5, 2]
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 0, 0) to the Virtual Link's (11, 2, 0) routing over the physical topology.
  • Source Node11
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 0, 0) to the Virtual Link's (11, 2, 0) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 0, 0) to the Virtual Link's (11, 2, 0) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 0, 0) to the Virtual Link's (11, 2, 0) routing over the physical topology.
  • Middle Node6
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 0, 0) to the Virtual Link's (11, 2, 0) routing over the physical topology.
  • Middle Node4
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 0, 0) to the Virtual Link's (11, 2, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node2
    3 Node11→Node10
    (11,10,0)
    34.577 5.423 Shortest path: [Node11, Node10]

    Shortest path: [11, 10]
    Link 17 : Node11→Node10 408.0 1
  • Appended the Physical Link: (11, 10, 0, 0) to the Virtual Link's (11, 10, 0) routing over the physical topology.
  • Source Node11
    -- 0 no wavelength id Destination Node10
    4 Node8→Node9
    (8,9,0)
    34.51 5.49 Shortest path: [Node8, Node9]

    Shortest path: [8, 9]
    Link 14 : Node8→Node9 752.0 1
  • Appended the Physical Link: (8, 9, 0, 0) to the Virtual Link's (8, 9, 0) routing over the physical topology.
  • Source Node8
    -- 0 no wavelength id Destination Node9
    5 Node1→Node2
    (1,2,0)
    39.608 0.392 Shortest path: [Node1, Node2]

    Shortest path: [1, 2]
    Link 2 : Node1→Node2 380.0 1
  • Appended the Physical Link: (1, 2, 0, 0) to the Virtual Link's (1, 2, 0) routing over the physical topology.
  • Source Node1
    -- 0 no wavelength id Destination Node2
    6 Node1→Node6
    (1,6,0)
    34.242 5.758 Shortest path: [Node1, Node7, Node6]

    Shortest path: [1, 7, 6]
    Link 4 : Node1→Node7 868.0 1
  • Appended the Physical Link: (1, 7, 0, 0) to the Virtual Link's (1, 6, 0) routing over the physical topology.
  • Source Node1
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 0, 1) to the Virtual Link's (1, 6, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node6
    7 Node3→Node1
    (3,1,0)
    34.179 5.821 Shortest path: [Node3, Node0, Node1]

    Shortest path: [3, 0, 1]
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 0, 0) to the Virtual Link's (3, 1, 0) routing over the physical topology.
  • Source Node3
    Link 0 : Node0→Node1 260.0 1
  • Appended the Physical Link: (0, 1, 0, 0) to the Virtual Link's (3, 1, 0) routing over the physical topology.
  • Middle Node0
    -- 0 no wavelength id Destination Node1
    8 Node13→Node1
    (13,1,0)
    34.134 5.866 Shortest path: [Node13, Node8, Node7, Node1]

    Shortest path: [13, 8, 7, 1]
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 0, 0) to the Virtual Link's (13, 1, 0) routing over the physical topology.
  • Source Node13
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 0, 1) to the Virtual Link's (13, 1, 0) routing over the physical topology.
  • Middle Node8
    Link 4 : Node7→Node1 868.0 1
  • Appended the Physical Link: (7, 1, 0, 1) to the Virtual Link's (13, 1, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node1
    9 Node4→Node13
    (4,13,0)
    33.784 6.216 Shortest path: [Node4, Node6, Node7, Node8, Node13]

    Shortest path: [4, 6, 7, 8, 13]
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 0, 1) to the Virtual Link's (4, 13, 0) routing over the physical topology.
  • Source Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 0, 2) to the Virtual Link's (4, 13, 0) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 0, 2) to the Virtual Link's (4, 13, 0) routing over the physical topology.
  • Middle Node7
    Link 16 : Node8→Node13 668.0 1
  • Appended the Physical Link: (8, 13, 0, 1) to the Virtual Link's (4, 13, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node13
    10 Node10→Node4
    (10,4,0)
    33.41 6.59 Shortest path: [Node10, Node3, Node4]

    Shortest path: [10, 3, 4]
    Link 11 : Node10→Node3 1140.0 1
  • Appended the Physical Link: (10, 3, 0, 0) to the Virtual Link's (10, 4, 0) routing over the physical topology.
  • Source Node10
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 0, 0) to the Virtual Link's (10, 4, 0) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node4
    11 Node0→Node9
    (0,9,0)
    33.309 6.691 Shortest path: [Node0, Node2, Node5, Node9]

    Shortest path: [0, 2, 5, 9]
    Link 1 : Node0→Node2 252.0 1
  • Appended the Physical Link: (0, 2, 0, 0) to the Virtual Link's (0, 9, 0) routing over the physical topology.
  • Source Node0
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 0, 1) to the Virtual Link's (0, 9, 0) routing over the physical topology.
  • Middle Node2
    Link 12 : Node5→Node9 704.0 1
  • Appended the Physical Link: (5, 9, 0, 0) to the Virtual Link's (0, 9, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node9
    12 Node3→Node9
    (3,9,0)
    38.696 1.304 Shortest path: [Node3, Node4, Node5, Node9]

    Shortest path: [3, 4, 5, 9]
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 0, 1) to the Virtual Link's (3, 9, 0) routing over the physical topology.
  • Source Node3
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 0, 1) to the Virtual Link's (3, 9, 0) routing over the physical topology.
  • Middle Node4
    Link 12 : Node5→Node9 704.0 1
  • Appended the Physical Link: (5, 9, 0, 1) to the Virtual Link's (3, 9, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node9
    13 Node5→Node11
    (5,11,0)
    32.886 7.114 Shortest path: [Node5, Node4, Node6, Node7, Node8, Node11]

    Shortest path: [5, 4, 6, 7, 8, 11]
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 0, 2) to the Virtual Link's (5, 11, 0) routing over the physical topology.
  • Source Node5
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 0, 2) to the Virtual Link's (5, 11, 0) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 0, 3) to the Virtual Link's (5, 11, 0) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 0, 3) to the Virtual Link's (5, 11, 0) routing over the physical topology.
  • Middle Node7
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 0, 1) to the Virtual Link's (5, 11, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node11
    14 Node3→Node8
    (3,8,0)
    32.882 7.118 Shortest path: [Node3, Node4, Node6, Node7, Node8]

    Shortest path: [3, 4, 6, 7, 8]
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 0, 2) to the Virtual Link's (3, 8, 0) routing over the physical topology.
  • Source Node3
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 0, 3) to the Virtual Link's (3, 8, 0) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 0, 4) to the Virtual Link's (3, 8, 0) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 0, 4) to the Virtual Link's (3, 8, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node8
    15 Node3→Node10
    (3,10,0)
    32.53 7.47 Shortest path: [Node3, Node10]

    Shortest path: [3, 10]
    Link 11 : Node3→Node10 1140.0 1
  • Appended the Physical Link: (3, 10, 0, 1) to the Virtual Link's (3, 10, 0) routing over the physical topology.
  • Source Node3
    -- 0 no wavelength id Destination Node10
    16 Node7→Node3
    (7,3,0)
    32.28 7.72 Shortest path: [Node7, Node6, Node4, Node3]

    Shortest path: [7, 6, 4, 3]
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 0, 5) to the Virtual Link's (7, 3, 0) routing over the physical topology.
  • Source Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 0, 4) to the Virtual Link's (7, 3, 0) routing over the physical topology.
  • Middle Node6
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 0, 3) to the Virtual Link's (7, 3, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node3
    17 Node12→Node8
    (12,8,0)
    39.897 0.103 Shortest path: [Node12, Node13, Node8]

    Shortest path: [12, 13, 8]
    Link 20 : Node12→Node13 352.0 1
  • Appended the Physical Link: (12, 13, 0, 0) to the Virtual Link's (12, 8, 0) routing over the physical topology.
  • Source Node12
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 0, 2) to the Virtual Link's (12, 8, 0) routing over the physical topology.
  • Middle Node13
    -- 0 no wavelength id Destination Node8
    18 Node8→Node7
    (8,7,0)
    32.057 7.943 Shortest path: [Node8, Node7]

    Shortest path: [8, 7]
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 0, 5) to the Virtual Link's (8, 7, 0) routing over the physical topology.
  • Source Node8
    -- 0 no wavelength id Destination Node7
    19 Node11→Node13
    (11,13,0)
    39.741 0.259 Shortest path: [Node11, Node12, Node13]

    Shortest path: [11, 12, 13]
    Link 18 : Node11→Node12 664.0 1
  • Appended the Physical Link: (11, 12, 0, 0) to the Virtual Link's (11, 13, 0) routing over the physical topology.
  • Source Node11
    Link 20 : Node12→Node13 352.0 1
  • Appended the Physical Link: (12, 13, 0, 1) to the Virtual Link's (11, 13, 0) routing over the physical topology.
  • Middle Node12
    -- 0 no wavelength id Destination Node13
    20 Node6→Node7
    (6,7,0)
    31.776 8.224 Shortest path: [Node6, Node7]

    Shortest path: [6, 7]
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 0, 6) to the Virtual Link's (6, 7, 0) routing over the physical topology.
  • Source Node6
    -- 0 no wavelength id Destination Node7
    21 Node5→Node1
    (5,1,0)
    39.389 0.611 Shortest path: [Node5, Node2, Node1]

    Shortest path: [5, 2, 1]
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 0, 2) to the Virtual Link's (5, 1, 0) routing over the physical topology.
  • Source Node5
    Link 2 : Node2→Node1 380.0 1
  • Appended the Physical Link: (2, 1, 0, 1) to the Virtual Link's (5, 1, 0) routing over the physical topology.
  • Middle Node2
    -- 0 no wavelength id Destination Node1
    22 Node6→Node9
    (6,9,0)
    31.724 8.276 Shortest path: [Node6, Node7, Node8, Node9]

    Shortest path: [6, 7, 8, 9]
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 0, 7) to the Virtual Link's (6, 9, 0) routing over the physical topology.
  • Source Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 0, 6) to the Virtual Link's (6, 9, 0) routing over the physical topology.
  • Middle Node7
    Link 14 : Node8→Node9 752.0 1
  • Appended the Physical Link: (8, 9, 0, 1) to the Virtual Link's (6, 9, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node9
    23 Node10→Node12
    (10,12,0)
    31.202 8.798 Shortest path: [Node10, Node13, Node12]

    Shortest path: [10, 13, 12]
    Link 19 : Node10→Node13 684.0 1
  • Appended the Physical Link: (10, 13, 0, 1) to the Virtual Link's (10, 12, 0) routing over the physical topology.
  • Source Node10
    Link 20 : Node13→Node12 352.0 1
  • Appended the Physical Link: (13, 12, 0, 2) to the Virtual Link's (10, 12, 0) routing over the physical topology.
  • Middle Node13
    -- 0 no wavelength id Destination Node12
    24 Node5→Node2
    (5,2,0)
    31.194 8.806 Shortest path: [Node5, Node2]

    Shortest path: [5, 2]
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 0, 3) to the Virtual Link's (5, 2, 0) routing over the physical topology.
  • Source Node5
    -- 0 no wavelength id Destination Node2
    25 Node2→Node7
    (2,7,0)
    30.975 9.025 Shortest path: [Node2, Node5, Node4, Node6, Node7]

    Shortest path: [2, 5, 4, 6, 7]
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 0, 4) to the Virtual Link's (2, 7, 0) routing over the physical topology.
  • Source Node2
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 0, 3) to the Virtual Link's (2, 7, 0) routing over the physical topology.
  • Middle Node5
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 0, 5) to the Virtual Link's (2, 7, 0) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 0, 8) to the Virtual Link's (2, 7, 0) routing over the physical topology.
  • Middle Node6
    -- 0 no wavelength id Destination Node7
    26 Node10→Node9
    (10,9,0)
    30.641 9.359 Shortest path: [Node10, Node11, Node8, Node9]

    Shortest path: [10, 11, 8, 9]
    Link 17 : Node10→Node11 408.0 1
  • Appended the Physical Link: (10, 11, 0, 1) to the Virtual Link's (10, 9, 0) routing over the physical topology.
  • Source Node10
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 0, 2) to the Virtual Link's (10, 9, 0) routing over the physical topology.
  • Middle Node11
    Link 14 : Node8→Node9 752.0 1
  • Appended the Physical Link: (8, 9, 0, 2) to the Virtual Link's (10, 9, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node9
    27 Node1→Node4
    (1,4,0)
    39.633 0.367 Shortest path: [Node1, Node0, Node3, Node4]

    Shortest path: [1, 0, 3, 4]
    Link 0 : Node1→Node0 260.0 1
  • Appended the Physical Link: (1, 0, 0, 1) to the Virtual Link's (1, 4, 0) routing over the physical topology.
  • Source Node1
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 0, 1) to the Virtual Link's (1, 4, 0) routing over the physical topology.
  • Middle Node0
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 0, 4) to the Virtual Link's (1, 4, 0) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node4
    28 Node11→Node4
    (11,4,0)
    39.246 0.754 Shortest path: [Node11, Node8, Node7, Node6, Node4]

    Shortest path: [11, 8, 7, 6, 4]
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 0, 3) to the Virtual Link's (11, 4, 0) routing over the physical topology.
  • Source Node11
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 0, 7) to the Virtual Link's (11, 4, 0) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 0, 9) to the Virtual Link's (11, 4, 0) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 0, 6) to the Virtual Link's (11, 4, 0) routing over the physical topology.
  • Middle Node6
    -- 0 no wavelength id Destination Node4
    29 Node13→Node12
    (13,12,0)
    30.433 9.567 Shortest path: [Node13, Node12]

    Shortest path: [13, 12]
    Link 20 : Node13→Node12 352.0 1
  • Appended the Physical Link: (13, 12, 0, 3) to the Virtual Link's (13, 12, 0) routing over the physical topology.
  • Source Node13
    -- 0 no wavelength id Destination Node12
    30 Node5→Node8
    (5,8,0)
    30.251 9.749 Shortest path: [Node5, Node4, Node6, Node7, Node8]

    Shortest path: [5, 4, 6, 7, 8]
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 0, 4) to the Virtual Link's (5, 8, 0) routing over the physical topology.
  • Source Node5
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 0, 7) to the Virtual Link's (5, 8, 0) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 0, 10) to the Virtual Link's (5, 8, 0) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 0, 8) to the Virtual Link's (5, 8, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node8
    31 Node11→Node1
    (11,1,0)
    39.832 0.168 Shortest path: [Node11, Node8, Node7, Node1]

    Shortest path: [11, 8, 7, 1]
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 0, 4) to the Virtual Link's (11, 1, 0) routing over the physical topology.
  • Source Node11
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 0, 9) to the Virtual Link's (11, 1, 0) routing over the physical topology.
  • Middle Node8
    Link 4 : Node7→Node1 868.0 1
  • Appended the Physical Link: (7, 1, 0, 2) to the Virtual Link's (11, 1, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node1
    32 Node11→Node7
    (11,7,0)
    30.07 9.93 Shortest path: [Node11, Node8, Node7]

    Shortest path: [11, 8, 7]
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 0, 5) to the Virtual Link's (11, 7, 0) routing over the physical topology.
  • Source Node11
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 0, 10) to the Virtual Link's (11, 7, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node7
    33 Node9→Node4
    (9,4,0)
    38.993 1.007 Shortest path: [Node9, Node5, Node4]

    Shortest path: [9, 5, 4]
    Link 12 : Node9→Node5 704.0 1
  • Appended the Physical Link: (9, 5, 0, 2) to the Virtual Link's (9, 4, 0) routing over the physical topology.
  • Source Node9
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 0, 5) to the Virtual Link's (9, 4, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node4
    34 Node7→Node1
    (7,1,0)
    35.742 4.258 Shortest path: [Node7, Node1]

    Shortest path: [7, 1]
    Link 4 : Node7→Node1 868.0 1
  • Appended the Physical Link: (7, 1, 0, 3) to the Virtual Link's (7, 1, 0) routing over the physical topology.
  • Source Node7
    -- 0 no wavelength id Destination Node1
    35 Node5→Node7
    (5,7,0)
    38.008 1.992 Shortest path: [Node5, Node4, Node6, Node7]

    Shortest path: [5, 4, 6, 7]
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 0, 6) to the Virtual Link's (5, 7, 0) routing over the physical topology.
  • Source Node5
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 0, 8) to the Virtual Link's (5, 7, 0) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 0, 11) to the Virtual Link's (5, 7, 0) routing over the physical topology.
  • Middle Node6
    -- 0 no wavelength id Destination Node7
    36 Node6→Node10
    (6,10,0)
    37.705 2.295 Shortest path: [Node6, Node7, Node8, Node11, Node10]

    Shortest path: [6, 7, 8, 11, 10]
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 0, 12) to the Virtual Link's (6, 10, 0) routing over the physical topology.
  • Source Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 0, 11) to the Virtual Link's (6, 10, 0) routing over the physical topology.
  • Middle Node7
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 0, 6) to the Virtual Link's (6, 10, 0) routing over the physical topology.
  • Middle Node8
    Link 17 : Node11→Node10 408.0 1
  • Appended the Physical Link: (11, 10, 0, 2) to the Virtual Link's (6, 10, 0) routing over the physical topology.
  • Middle Node11
    -- 0 no wavelength id Destination Node10
    37 Node3→Node5
    (3,5,0)
    39.693 0.307 Shortest path: [Node3, Node4, Node5]

    Shortest path: [3, 4, 5]
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 0, 5) to the Virtual Link's (3, 5, 0) routing over the physical topology.
  • Source Node3
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 0, 7) to the Virtual Link's (3, 5, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node5
    38 Node2→Node4
    (2,4,0)
    39.729 0.271 Shortest path: [Node2, Node5, Node4]

    Shortest path: [2, 5, 4]
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 0, 5) to the Virtual Link's (2, 4, 0) routing over the physical topology.
  • Source Node2
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 0, 8) to the Virtual Link's (2, 4, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node4
    39 Node4→Node11
    (4,11,0)
    39.084 0.916 Shortest path: [Node4, Node6, Node7, Node8, Node11]

    Shortest path: [4, 6, 7, 8, 11]
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 0, 9) to the Virtual Link's (4, 11, 0) routing over the physical topology.
  • Source Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 0, 13) to the Virtual Link's (4, 11, 0) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 0, 12) to the Virtual Link's (4, 11, 0) routing over the physical topology.
  • Middle Node7
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 0, 7) to the Virtual Link's (4, 11, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node11
    40 Node7→Node9
    (7,9,0)
    39.163 0.837 Shortest path: [Node7, Node8, Node9]

    Shortest path: [7, 8, 9]
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 0, 13) to the Virtual Link's (7, 9, 0) routing over the physical topology.
  • Source Node7
    Link 14 : Node8→Node9 752.0 1
  • Appended the Physical Link: (8, 9, 0, 3) to the Virtual Link's (7, 9, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node9
    41 Node0→Node1
    (0,1,0)
    37.88 2.12 Shortest path: [Node0, Node1]

    Shortest path: [0, 1]
    Link 0 : Node0→Node1 260.0 1
  • Appended the Physical Link: (0, 1, 0, 2) to the Virtual Link's (0, 1, 0) routing over the physical topology.
  • Source Node0
    -- 0 no wavelength id Destination Node1
    42 Node0→Node8
    (0,8,0)
    37.721 2.279 Shortest path: [Node0, Node3, Node4, Node6, Node7, Node8]

    Shortest path: [0, 3, 4, 6, 7, 8]
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 0, 2) to the Virtual Link's (0, 8, 0) routing over the physical topology.
  • Source Node0
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 0, 6) to the Virtual Link's (0, 8, 0) routing over the physical topology.
  • Middle Node3
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 0, 10) to the Virtual Link's (0, 8, 0) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 0, 14) to the Virtual Link's (0, 8, 0) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 0, 14) to the Virtual Link's (0, 8, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node8
    43 Node13→Node3
    (13,3,0)
    36.25 3.75 Shortest path: [Node13, Node8, Node7, Node6, Node4, Node3]

    Shortest path: [13, 8, 7, 6, 4, 3]
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 0, 3) to the Virtual Link's (13, 3, 0) routing over the physical topology.
  • Source Node13
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 0, 15) to the Virtual Link's (13, 3, 0) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 0, 15) to the Virtual Link's (13, 3, 0) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 0, 11) to the Virtual Link's (13, 3, 0) routing over the physical topology.
  • Middle Node6
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 0, 7) to the Virtual Link's (13, 3, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node3
    44 Node13→Node4
    (13,4,0)
    37.75 2.25 Shortest path: [Node13, Node8, Node7, Node6, Node4]

    Shortest path: [13, 8, 7, 6, 4]
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 0, 4) to the Virtual Link's (13, 4, 0) routing over the physical topology.
  • Source Node13
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 1, 0) to the Virtual Link's (13, 4, 0) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 1, 0) to the Virtual Link's (13, 4, 0) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 0, 12) to the Virtual Link's (13, 4, 0) routing over the physical topology.
  • Middle Node6
    -- 0 no wavelength id Destination Node4
    45 Node13→Node11
    (13,11,0)
    28.741 11.259 Shortest path: [Node13, Node12, Node11]

    Shortest path: [13, 12, 11]
    Link 20 : Node13→Node12 352.0 1
  • Appended the Physical Link: (13, 12, 0, 4) to the Virtual Link's (13, 11, 0) routing over the physical topology.
  • Source Node13
    Link 18 : Node12→Node11 664.0 1
  • Appended the Physical Link: (12, 11, 0, 1) to the Virtual Link's (13, 11, 0) routing over the physical topology.
  • Middle Node12
    -- 0 no wavelength id Destination Node11
    46 Node13→Node0
    (13,0,0)
    36.698 3.302 Shortest path: [Node13, Node8, Node7, Node6, Node4, Node3, Node0]

    Shortest path: [13, 8, 7, 6, 4, 3, 0]
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 0, 5) to the Virtual Link's (13, 0, 0) routing over the physical topology.
  • Source Node13
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 1, 1) to the Virtual Link's (13, 0, 0) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 1, 1) to the Virtual Link's (13, 0, 0) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 0, 13) to the Virtual Link's (13, 0, 0) routing over the physical topology.
  • Middle Node6
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 0, 8) to the Virtual Link's (13, 0, 0) routing over the physical topology.
  • Middle Node4
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 0, 3) to the Virtual Link's (13, 0, 0) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node0
    47 Node8→Node11
    (8,11,0)
    38.451 1.549 Shortest path: [Node8, Node11]

    Shortest path: [8, 11]
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 0, 8) to the Virtual Link's (8, 11, 0) routing over the physical topology.
  • Source Node8
    -- 0 no wavelength id Destination Node11
    48 Node4→Node3
    (4,3,0)
    38.723 1.277 Shortest path: [Node4, Node3]

    Shortest path: [4, 3]
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 0, 9) to the Virtual Link's (4, 3, 0) routing over the physical topology.
  • Source Node4
    -- 0 no wavelength id Destination Node3
    49 Node7→Node12
    (7,12,0)
    36.328 3.672 Shortest path: [Node7, Node8, Node13, Node12]

    Shortest path: [7, 8, 13, 12]
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 1, 2) to the Virtual Link's (7, 12, 0) routing over the physical topology.
  • Source Node7
    Link 16 : Node8→Node13 668.0 1
  • Appended the Physical Link: (8, 13, 0, 6) to the Virtual Link's (7, 12, 0) routing over the physical topology.
  • Middle Node8
    Link 20 : Node13→Node12 352.0 1
  • Appended the Physical Link: (13, 12, 0, 5) to the Virtual Link's (7, 12, 0) routing over the physical topology.
  • Middle Node13
    -- 0 no wavelength id Destination Node12
    50 Node12→Node9
    (12,9,0)
    39.694 0.306 Shortest path: [Node12, Node5, Node9]

    Shortest path: [12, 5, 9]
    Link 13 : Node12→Node5 1036.0 1
  • Appended the Physical Link: (12, 5, 0, 0) to the Virtual Link's (12, 9, 0) routing over the physical topology.
  • Source Node12
    Link 12 : Node5→Node9 704.0 1
  • Appended the Physical Link: (5, 9, 0, 3) to the Virtual Link's (12, 9, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node9
    51 Node8→Node2
    (8,2,0)
    34.241 5.759 Shortest path: [Node8, Node7, Node6, Node4, Node5, Node2]

    Shortest path: [8, 7, 6, 4, 5, 2]
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 1, 3) to the Virtual Link's (8, 2, 0) routing over the physical topology.
  • Source Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 1, 2) to the Virtual Link's (8, 2, 0) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 0, 14) to the Virtual Link's (8, 2, 0) routing over the physical topology.
  • Middle Node6
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 0, 9) to the Virtual Link's (8, 2, 0) routing over the physical topology.
  • Middle Node4
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 0, 6) to the Virtual Link's (8, 2, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node2
    52 Node4→Node7
    (4,7,0)
    37.698 2.302 Shortest path: [Node4, Node6, Node7]

    Shortest path: [4, 6, 7]
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 0, 15) to the Virtual Link's (4, 7, 0) routing over the physical topology.
  • Source Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 1, 3) to the Virtual Link's (4, 7, 0) routing over the physical topology.
  • Middle Node6
    -- 0 no wavelength id Destination Node7
    53 Node12→Node13
    (12,13,0)
    39.849 0.151 Shortest path: [Node12, Node13]

    Shortest path: [12, 13]
    Link 20 : Node12→Node13 352.0 1
  • Appended the Physical Link: (12, 13, 0, 6) to the Virtual Link's (12, 13, 0) routing over the physical topology.
  • Source Node12
    -- 0 no wavelength id Destination Node13
    54 Node1→Node7
    (1,7,0)
    36.991 3.009 Shortest path: [Node1, Node7]

    Shortest path: [1, 7]
    Link 4 : Node1→Node7 868.0 1
  • Appended the Physical Link: (1, 7, 0, 4) to the Virtual Link's (1, 7, 0) routing over the physical topology.
  • Source Node1
    -- 0 no wavelength id Destination Node7
    55 Node9→Node7
    (9,7,0)
    39.433 0.567 Shortest path: [Node9, Node8, Node7]

    Shortest path: [9, 8, 7]
    Link 14 : Node9→Node8 752.0 1
  • Appended the Physical Link: (9, 8, 0, 4) to the Virtual Link's (9, 7, 0) routing over the physical topology.
  • Source Node9
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 1, 4) to the Virtual Link's (9, 7, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node7
    56 Node1→Node0
    (1,0,0)
    39.428 0.572 Shortest path: [Node1, Node0]

    Shortest path: [1, 0]
    Link 0 : Node1→Node0 260.0 1
  • Appended the Physical Link: (1, 0, 0, 3) to the Virtual Link's (1, 0, 0) routing over the physical topology.
  • Source Node1
    -- 0 no wavelength id Destination Node0
    57 Node8→Node12
    (8,12,0)
    33.246 6.754 Shortest path: [Node8, Node13, Node12]

    Shortest path: [8, 13, 12]
    Link 16 : Node8→Node13 668.0 1
  • Appended the Physical Link: (8, 13, 0, 7) to the Virtual Link's (8, 12, 0) routing over the physical topology.
  • Source Node8
    Link 20 : Node13→Node12 352.0 1
  • Appended the Physical Link: (13, 12, 0, 7) to the Virtual Link's (8, 12, 0) routing over the physical topology.
  • Middle Node13
    -- 0 no wavelength id Destination Node12
    58 Node13→Node5
    (13,5,0)
    35.026 4.974 Shortest path: [Node13, Node12, Node5]

    Shortest path: [13, 12, 5]
    Link 20 : Node13→Node12 352.0 1
  • Appended the Physical Link: (13, 12, 0, 8) to the Virtual Link's (13, 5, 0) routing over the physical topology.
  • Source Node13
    Link 13 : Node12→Node5 1036.0 1
  • Appended the Physical Link: (12, 5, 0, 1) to the Virtual Link's (13, 5, 0) routing over the physical topology.
  • Middle Node12
    -- 0 no wavelength id Destination Node5
    59 Node11→Node6
    (11,6,0)
    38.181 1.819 Shortest path: [Node11, Node8, Node7, Node6]

    Shortest path: [11, 8, 7, 6]
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 0, 9) to the Virtual Link's (11, 6, 0) routing over the physical topology.
  • Source Node11
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 1, 5) to the Virtual Link's (11, 6, 0) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 1, 4) to the Virtual Link's (11, 6, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node6
    60 Node5→Node3
    (5,3,0)
    38.109 1.891 Shortest path: [Node5, Node4, Node3]

    Shortest path: [5, 4, 3]
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 0, 10) to the Virtual Link's (5, 3, 0) routing over the physical topology.
  • Source Node5
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 0, 10) to the Virtual Link's (5, 3, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node3
    61 Node4→Node2
    (4,2,0)
    32.359 7.641 Shortest path: [Node4, Node5, Node2]

    Shortest path: [4, 5, 2]
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 0, 11) to the Virtual Link's (4, 2, 0) routing over the physical topology.
  • Source Node4
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 0, 7) to the Virtual Link's (4, 2, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node2
    62 Node7→Node6
    (7,6,0)
    38.358 1.642 Shortest path: [Node7, Node6]

    Shortest path: [7, 6]
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 1, 5) to the Virtual Link's (7, 6, 0) routing over the physical topology.
  • Source Node7
    -- 0 no wavelength id Destination Node6
    63 Node10→Node0
    (10,0,0)
    39.879 0.121 Shortest path: [Node10, Node3, Node0]

    Shortest path: [10, 3, 0]
    Link 11 : Node10→Node3 1140.0 1
  • Appended the Physical Link: (10, 3, 0, 2) to the Virtual Link's (10, 0, 0) routing over the physical topology.
  • Source Node10
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 0, 4) to the Virtual Link's (10, 0, 0) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node0
    64 Node2→Node12
    (2,12,0)
    26.956 13.044 Shortest path: [Node2, Node5, Node12]

    Shortest path: [2, 5, 12]
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 0, 8) to the Virtual Link's (2, 12, 0) routing over the physical topology.
  • Source Node2
    Link 13 : Node5→Node12 1036.0 1
  • Appended the Physical Link: (5, 12, 0, 2) to the Virtual Link's (2, 12, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node12
    65 Node4→Node9
    (4,9,0)
    26.748 13.252 Shortest path: [Node4, Node5, Node9]

    Shortest path: [4, 5, 9]
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 0, 12) to the Virtual Link's (4, 9, 0) routing over the physical topology.
  • Source Node4
    Link 12 : Node5→Node9 704.0 1
  • Appended the Physical Link: (5, 9, 0, 4) to the Virtual Link's (4, 9, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node9
    66 Node13→Node9
    (13,9,0)
    26.167 13.833 Shortest path: [Node13, Node8, Node9]

    Shortest path: [13, 8, 9]
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 0, 8) to the Virtual Link's (13, 9, 0) routing over the physical topology.
  • Source Node13
    Link 14 : Node8→Node9 752.0 1
  • Appended the Physical Link: (8, 9, 0, 5) to the Virtual Link's (13, 9, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node9
    67 Node2→Node6
    (2,6,0)
    39.76 0.24 Shortest path: [Node2, Node5, Node4, Node6]

    Shortest path: [2, 5, 4, 6]
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 0, 9) to the Virtual Link's (2, 6, 0) routing over the physical topology.
  • Source Node2
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 0, 13) to the Virtual Link's (2, 6, 0) routing over the physical topology.
  • Middle Node5
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 1, 0) to the Virtual Link's (2, 6, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node6
    68 Node5→Node13
    (5,13,0)
    39.629 0.371 Shortest path: [Node5, Node12, Node13]

    Shortest path: [5, 12, 13]
    Link 13 : Node5→Node12 1036.0 1
  • Appended the Physical Link: (5, 12, 0, 3) to the Virtual Link's (5, 13, 0) routing over the physical topology.
  • Source Node5
    Link 20 : Node12→Node13 352.0 1
  • Appended the Physical Link: (12, 13, 0, 9) to the Virtual Link's (5, 13, 0) routing over the physical topology.
  • Middle Node12
    -- 0 no wavelength id Destination Node13
    69 Node6→Node4
    (6,4,0)
    39.207 0.793 Shortest path: [Node6, Node4]

    Shortest path: [6, 4]
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 1, 1) to the Virtual Link's (6, 4, 0) routing over the physical topology.
  • Source Node6
    -- 0 no wavelength id Destination Node4
    70 Node13→Node2
    (13,2,0)
    25.537 14.463 Shortest path: [Node13, Node12, Node5, Node2]

    Shortest path: [13, 12, 5, 2]
    Link 20 : Node13→Node12 352.0 1
  • Appended the Physical Link: (13, 12, 0, 10) to the Virtual Link's (13, 2, 0) routing over the physical topology.
  • Source Node13
    Link 13 : Node12→Node5 1036.0 1
  • Appended the Physical Link: (12, 5, 0, 4) to the Virtual Link's (13, 2, 0) routing over the physical topology.
  • Middle Node12
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 0, 10) to the Virtual Link's (13, 2, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node2
    71 Node8→Node5
    (8,5,0)
    39.17 0.83 Shortest path: [Node8, Node7, Node6, Node4, Node5]

    Shortest path: [8, 7, 6, 4, 5]
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 1, 6) to the Virtual Link's (8, 5, 0) routing over the physical topology.
  • Source Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 1, 6) to the Virtual Link's (8, 5, 0) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 1, 2) to the Virtual Link's (8, 5, 0) routing over the physical topology.
  • Middle Node6
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 0, 14) to the Virtual Link's (8, 5, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node5
    72 Node12→Node0
    (12,0,0)
    39.489 0.511 Shortest path: [Node12, Node5, Node2, Node0]

    Shortest path: [12, 5, 2, 0]
    Link 13 : Node12→Node5 1036.0 1
  • Appended the Physical Link: (12, 5, 0, 5) to the Virtual Link's (12, 0, 0) routing over the physical topology.
  • Source Node12
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 0, 11) to the Virtual Link's (12, 0, 0) routing over the physical topology.
  • Middle Node5
    Link 1 : Node2→Node0 252.0 1
  • Appended the Physical Link: (2, 0, 0, 1) to the Virtual Link's (12, 0, 0) routing over the physical topology.
  • Middle Node2
    -- 0 no wavelength id Destination Node0
    73 Node0→Node7
    (0,7,0)
    39.881 0.119 Shortest path: [Node0, Node3, Node4, Node6, Node7]

    Shortest path: [0, 3, 4, 6, 7]
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 0, 5) to the Virtual Link's (0, 7, 0) routing over the physical topology.
  • Source Node0
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 0, 11) to the Virtual Link's (0, 7, 0) routing over the physical topology.
  • Middle Node3
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 1, 3) to the Virtual Link's (0, 7, 0) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 1, 7) to the Virtual Link's (0, 7, 0) routing over the physical topology.
  • Middle Node6
    -- 0 no wavelength id Destination Node7
    74 Node13→Node8
    (13,8,0)
    39.136 0.864 Shortest path: [Node13, Node8]

    Shortest path: [13, 8]
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 0, 9) to the Virtual Link's (13, 8, 0) routing over the physical topology.
  • Source Node13
    -- 0 no wavelength id Destination Node8
    75 Node13→Node6
    (13,6,0)
    38.587 1.413 Shortest path: [Node13, Node8, Node7, Node6]

    Shortest path: [13, 8, 7, 6]
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 0, 10) to the Virtual Link's (13, 6, 0) routing over the physical topology.
  • Source Node13
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 1, 7) to the Virtual Link's (13, 6, 0) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 1, 8) to the Virtual Link's (13, 6, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node6
    76 Node10→Node8
    (10,8,0)
    38.412 1.588 Shortest path: [Node10, Node11, Node8]

    Shortest path: [10, 11, 8]
    Link 17 : Node10→Node11 408.0 1
  • Appended the Physical Link: (10, 11, 0, 3) to the Virtual Link's (10, 8, 0) routing over the physical topology.
  • Source Node10
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 0, 10) to the Virtual Link's (10, 8, 0) routing over the physical topology.
  • Middle Node11
    -- 0 no wavelength id Destination Node8
    77 Node10→Node2
    (10,2,0)
    35.259 4.741 Shortest path: [Node10, Node3, Node0, Node2]

    Shortest path: [10, 3, 0, 2]
    Link 11 : Node10→Node3 1140.0 1
  • Appended the Physical Link: (10, 3, 0, 3) to the Virtual Link's (10, 2, 0) routing over the physical topology.
  • Source Node10
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 0, 6) to the Virtual Link's (10, 2, 0) routing over the physical topology.
  • Middle Node3
    Link 1 : Node0→Node2 252.0 1
  • Appended the Physical Link: (0, 2, 0, 2) to the Virtual Link's (10, 2, 0) routing over the physical topology.
  • Middle Node0
    -- 0 no wavelength id Destination Node2
    78 Node0→Node13
    (0,13,0)
    38.632 1.368 Shortest path: [Node0, Node3, Node4, Node6, Node7, Node8, Node13]

    Shortest path: [0, 3, 4, 6, 7, 8, 13]
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 0, 7) to the Virtual Link's (0, 13, 0) routing over the physical topology.
  • Source Node0
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 0, 12) to the Virtual Link's (0, 13, 0) routing over the physical topology.
  • Middle Node3
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 1, 4) to the Virtual Link's (0, 13, 0) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 1, 9) to the Virtual Link's (0, 13, 0) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 1, 8) to the Virtual Link's (0, 13, 0) routing over the physical topology.
  • Middle Node7
    Link 16 : Node8→Node13 668.0 1
  • Appended the Physical Link: (8, 13, 0, 11) to the Virtual Link's (0, 13, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node13
    79 Node3→Node12
    (3,12,0)
    36.195 3.805 Shortest path: [Node3, Node4, Node5, Node12]

    Shortest path: [3, 4, 5, 12]
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 0, 13) to the Virtual Link's (3, 12, 0) routing over the physical topology.
  • Source Node3
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 0, 15) to the Virtual Link's (3, 12, 0) routing over the physical topology.
  • Middle Node4
    Link 13 : Node5→Node12 1036.0 1
  • Appended the Physical Link: (5, 12, 0, 6) to the Virtual Link's (3, 12, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node12
    80 Node4→Node6
    (4,6,0)
    39.988 0.012 Shortest path: [Node4, Node6]

    Shortest path: [4, 6]
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 1, 5) to the Virtual Link's (4, 6, 0) routing over the physical topology.
  • Source Node4
    -- 0 no wavelength id Destination Node6
    81 Node10→Node13
    (10,13,0)
    37.65 2.35 Shortest path: [Node10, Node13]

    Shortest path: [10, 13]
    Link 19 : Node10→Node13 684.0 1
  • Appended the Physical Link: (10, 13, 0, 2) to the Virtual Link's (10, 13, 0) routing over the physical topology.
  • Source Node10
    -- 0 no wavelength id Destination Node13
    82 Node6→Node13
    (6,13,0)
    35.23 4.77 Shortest path: [Node6, Node7, Node8, Node13]

    Shortest path: [6, 7, 8, 13]
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 1, 10) to the Virtual Link's (6, 13, 0) routing over the physical topology.
  • Source Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 1, 9) to the Virtual Link's (6, 13, 0) routing over the physical topology.
  • Middle Node7
    Link 16 : Node8→Node13 668.0 1
  • Appended the Physical Link: (8, 13, 0, 12) to the Virtual Link's (6, 13, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node13
    83 Node6→Node3
    (6,3,0)
    37.966 2.034 Shortest path: [Node6, Node4, Node3]

    Shortest path: [6, 4, 3]
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 1, 6) to the Virtual Link's (6, 3, 0) routing over the physical topology.
  • Source Node6
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 0, 14) to the Virtual Link's (6, 3, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node3
    84 Node10→Node11
    (10,11,0)
    39.598 0.402 Shortest path: [Node10, Node11]

    Shortest path: [10, 11]
    Link 17 : Node10→Node11 408.0 1
  • Appended the Physical Link: (10, 11, 0, 4) to the Virtual Link's (10, 11, 0) routing over the physical topology.
  • Source Node10
    -- 0 no wavelength id Destination Node11
    85 Node2→Node3
    (2,3,0)
    23.637 16.363 Shortest path: [Node2, Node0, Node3]

    Shortest path: [2, 0, 3]
    Link 1 : Node2→Node0 252.0 1
  • Appended the Physical Link: (2, 0, 0, 3) to the Virtual Link's (2, 3, 0) routing over the physical topology.
  • Source Node2
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 0, 8) to the Virtual Link's (2, 3, 0) routing over the physical topology.
  • Middle Node0
    -- 0 no wavelength id Destination Node3
    86 Node12→Node10
    (12,10,0)
    39.357 0.643 Shortest path: [Node12, Node13, Node10]

    Shortest path: [12, 13, 10]
    Link 20 : Node12→Node13 352.0 1
  • Appended the Physical Link: (12, 13, 0, 11) to the Virtual Link's (12, 10, 0) routing over the physical topology.
  • Source Node12
    Link 19 : Node13→Node10 684.0 1
  • Appended the Physical Link: (13, 10, 0, 3) to the Virtual Link's (12, 10, 0) routing over the physical topology.
  • Middle Node13
    -- 0 no wavelength id Destination Node10
    87 Node11→Node12
    (11,12,0)
    23.372 16.628 Shortest path: [Node11, Node12]

    Shortest path: [11, 12]
    Link 18 : Node11→Node12 664.0 1
  • Appended the Physical Link: (11, 12, 0, 2) to the Virtual Link's (11, 12, 0) routing over the physical topology.
  • Source Node11
    -- 0 no wavelength id Destination Node12
    88 Node2→Node11
    (2,11,0)
    39.452 0.548 Shortest path: [Node2, Node5, Node4, Node6, Node7, Node8, Node11]

    Shortest path: [2, 5, 4, 6, 7, 8, 11]
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 0, 12) to the Virtual Link's (2, 11, 0) routing over the physical topology.
  • Source Node2
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 1, 0) to the Virtual Link's (2, 11, 0) routing over the physical topology.
  • Middle Node5
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 1, 7) to the Virtual Link's (2, 11, 0) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 1, 11) to the Virtual Link's (2, 11, 0) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 1, 10) to the Virtual Link's (2, 11, 0) routing over the physical topology.
  • Middle Node7
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 0, 11) to the Virtual Link's (2, 11, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node11
    89 Node5→Node12
    (5,12,0)
    23.113 16.887 Shortest path: [Node5, Node12]

    Shortest path: [5, 12]
    Link 13 : Node5→Node12 1036.0 1
  • Appended the Physical Link: (5, 12, 0, 7) to the Virtual Link's (5, 12, 0) routing over the physical topology.
  • Source Node5
    -- 0 no wavelength id Destination Node12
    90 Node4→Node10
    (4,10,0)
    36.655 3.345 Shortest path: [Node4, Node3, Node10]

    Shortest path: [4, 3, 10]
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 0, 15) to the Virtual Link's (4, 10, 0) routing over the physical topology.
  • Source Node4
    Link 11 : Node3→Node10 1140.0 1
  • Appended the Physical Link: (3, 10, 0, 4) to the Virtual Link's (4, 10, 0) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node10
    91 Node11→Node5
    (11,5,0)
    37.109 2.891 Shortest path: [Node11, Node8, Node7, Node6, Node4, Node5]

    Shortest path: [11, 8, 7, 6, 4, 5]
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 0, 12) to the Virtual Link's (11, 5, 0) routing over the physical topology.
  • Source Node11
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 1, 11) to the Virtual Link's (11, 5, 0) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 1, 12) to the Virtual Link's (11, 5, 0) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 1, 8) to the Virtual Link's (11, 5, 0) routing over the physical topology.
  • Middle Node6
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 1, 1) to the Virtual Link's (11, 5, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node5
    92 Node12→Node3
    (12,3,0)
    35.076 4.924 Shortest path: [Node12, Node5, Node4, Node3]

    Shortest path: [12, 5, 4, 3]
    Link 13 : Node12→Node5 1036.0 1
  • Appended the Physical Link: (12, 5, 0, 8) to the Virtual Link's (12, 3, 0) routing over the physical topology.
  • Source Node12
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 1, 2) to the Virtual Link's (12, 3, 0) routing over the physical topology.
  • Middle Node5
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 1, 0) to the Virtual Link's (12, 3, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node3
    93 Node6→Node8
    (6,8,0)
    37.624 2.376 Shortest path: [Node6, Node7, Node8]

    Shortest path: [6, 7, 8]
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 1, 13) to the Virtual Link's (6, 8, 0) routing over the physical topology.
  • Source Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 1, 12) to the Virtual Link's (6, 8, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node8
    94 Node8→Node4
    (8,4,0)
    36.533 3.467 Shortest path: [Node8, Node7, Node6, Node4]

    Shortest path: [8, 7, 6, 4]
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 1, 13) to the Virtual Link's (8, 4, 0) routing over the physical topology.
  • Source Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 1, 14) to the Virtual Link's (8, 4, 0) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 1, 9) to the Virtual Link's (8, 4, 0) routing over the physical topology.
  • Middle Node6
    -- 0 no wavelength id Destination Node4
    95 Node9→Node3
    (9,3,0)
    21.812 18.188 Shortest path: [Node9, Node5, Node4, Node3]

    Shortest path: [9, 5, 4, 3]
    Link 12 : Node9→Node5 704.0 1
  • Appended the Physical Link: (9, 5, 0, 5) to the Virtual Link's (9, 3, 0) routing over the physical topology.
  • Source Node9
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 1, 3) to the Virtual Link's (9, 3, 0) routing over the physical topology.
  • Middle Node5
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 1, 1) to the Virtual Link's (9, 3, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node3
    96 Node3→Node13
    (3,13,0)
    37.488 2.512 Shortest path: [Node3, Node4, Node6, Node7, Node8, Node13]

    Shortest path: [3, 4, 6, 7, 8, 13]
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 1, 2) to the Virtual Link's (3, 13, 0) routing over the physical topology.
  • Source Node3
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 1, 10) to the Virtual Link's (3, 13, 0) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 1, 15) to the Virtual Link's (3, 13, 0) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 1, 14) to the Virtual Link's (3, 13, 0) routing over the physical topology.
  • Middle Node7
    Link 16 : Node8→Node13 668.0 1
  • Appended the Physical Link: (8, 13, 0, 13) to the Virtual Link's (3, 13, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node13
    97 Node0→Node6
    (0,6,0)
    21.474 18.526 Shortest path: [Node0, Node3, Node4, Node6]

    Shortest path: [0, 3, 4, 6]
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 0, 9) to the Virtual Link's (0, 6, 0) routing over the physical topology.
  • Source Node0
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 1, 3) to the Virtual Link's (0, 6, 0) routing over the physical topology.
  • Middle Node3
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 1, 11) to the Virtual Link's (0, 6, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node6
    98 Node7→Node2
    (7,2,0)
    21.425 18.575 Shortest path: [Node7, Node6, Node4, Node5, Node2]

    Shortest path: [7, 6, 4, 5, 2]
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 2, 0) to the Virtual Link's (7, 2, 0) routing over the physical topology.
  • Source Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 1, 12) to the Virtual Link's (7, 2, 0) routing over the physical topology.
  • Middle Node6
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 1, 4) to the Virtual Link's (7, 2, 0) routing over the physical topology.
  • Middle Node4
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 0, 13) to the Virtual Link's (7, 2, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node2
    99 Node2→Node13
    (2,13,0)
    38.804 1.196 Shortest path: [Node2, Node5, Node12, Node13]

    Shortest path: [2, 5, 12, 13]
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 0, 14) to the Virtual Link's (2, 13, 0) routing over the physical topology.
  • Source Node2
    Link 13 : Node5→Node12 1036.0 1
  • Appended the Physical Link: (5, 12, 0, 9) to the Virtual Link's (2, 13, 0) routing over the physical topology.
  • Middle Node5
    Link 20 : Node12→Node13 352.0 1
  • Appended the Physical Link: (12, 13, 0, 12) to the Virtual Link's (2, 13, 0) routing over the physical topology.
  • Middle Node12
    -- 0 no wavelength id Destination Node13
    100 Node7→Node5
    (7,5,0)
    35.16 4.84 Shortest path: [Node7, Node6, Node4, Node5]

    Shortest path: [7, 6, 4, 5]
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 2, 1) to the Virtual Link's (7, 5, 0) routing over the physical topology.
  • Source Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 1, 13) to the Virtual Link's (7, 5, 0) routing over the physical topology.
  • Middle Node6
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 1, 5) to the Virtual Link's (7, 5, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node5
    101 Node0→Node10
    (0,10,0)
    38.215 1.785 Shortest path: [Node0, Node3, Node10]

    Shortest path: [0, 3, 10]
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 0, 10) to the Virtual Link's (0, 10, 0) routing over the physical topology.
  • Source Node0
    Link 11 : Node3→Node10 1140.0 1
  • Appended the Physical Link: (3, 10, 0, 5) to the Virtual Link's (0, 10, 0) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node10
    102 Node5→Node10
    (5,10,0)
    37.586 2.414 Shortest path: [Node5, Node4, Node3, Node10]

    Shortest path: [5, 4, 3, 10]
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 1, 6) to the Virtual Link's (5, 10, 0) routing over the physical topology.
  • Source Node5
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 1, 4) to the Virtual Link's (5, 10, 0) routing over the physical topology.
  • Middle Node4
    Link 11 : Node3→Node10 1140.0 1
  • Appended the Physical Link: (3, 10, 0, 6) to the Virtual Link's (5, 10, 0) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node10
    103 Node5→Node0
    (5,0,0)
    36.731 3.269 Shortest path: [Node5, Node2, Node0]

    Shortest path: [5, 2, 0]
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 0, 15) to the Virtual Link's (5, 0, 0) routing over the physical topology.
  • Source Node5
    Link 1 : Node2→Node0 252.0 1
  • Appended the Physical Link: (2, 0, 0, 4) to the Virtual Link's (5, 0, 0) routing over the physical topology.
  • Middle Node2
    -- 0 no wavelength id Destination Node0
    104 Node3→Node4
    (3,4,0)
    36.345 3.655 Shortest path: [Node3, Node4]

    Shortest path: [3, 4]
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 1, 5) to the Virtual Link's (3, 4, 0) routing over the physical topology.
  • Source Node3
    -- 0 no wavelength id Destination Node4
    105 Node9→Node10
    (9,10,0)
    20.662 19.338 Shortest path: [Node9, Node8, Node11, Node10]

    Shortest path: [9, 8, 11, 10]
    Link 14 : Node9→Node8 752.0 1
  • Appended the Physical Link: (9, 8, 0, 6) to the Virtual Link's (9, 10, 0) routing over the physical topology.
  • Source Node9
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 0, 13) to the Virtual Link's (9, 10, 0) routing over the physical topology.
  • Middle Node8
    Link 17 : Node11→Node10 408.0 1
  • Appended the Physical Link: (11, 10, 0, 5) to the Virtual Link's (9, 10, 0) routing over the physical topology.
  • Middle Node11
    -- 0 no wavelength id Destination Node10
    106 Node4→Node5
    (4,5,0)
    36.325 3.675 Shortest path: [Node4, Node5]

    Shortest path: [4, 5]
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 1, 7) to the Virtual Link's (4, 5, 0) routing over the physical topology.
  • Source Node4
    -- 0 no wavelength id Destination Node5
    107 Node1→Node11
    (1,11,0)
    36.984 3.016 Shortest path: [Node1, Node7, Node8, Node11]

    Shortest path: [1, 7, 8, 11]
    Link 4 : Node1→Node7 868.0 1
  • Appended the Physical Link: (1, 7, 0, 5) to the Virtual Link's (1, 11, 0) routing over the physical topology.
  • Source Node1
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 1, 15) to the Virtual Link's (1, 11, 0) routing over the physical topology.
  • Middle Node7
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 0, 14) to the Virtual Link's (1, 11, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node11
    108 Node2→Node9
    (2,9,0)
    39.35 0.65 Shortest path: [Node2, Node5, Node9]

    Shortest path: [2, 5, 9]
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 1, 0) to the Virtual Link's (2, 9, 0) routing over the physical topology.
  • Source Node2
    Link 12 : Node5→Node9 704.0 1
  • Appended the Physical Link: (5, 9, 0, 6) to the Virtual Link's (2, 9, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node9
    109 Node12→Node4
    (12,4,0)
    35.785 4.215 Shortest path: [Node12, Node5, Node4]

    Shortest path: [12, 5, 4]
    Link 13 : Node12→Node5 1036.0 1
  • Appended the Physical Link: (12, 5, 0, 10) to the Virtual Link's (12, 4, 0) routing over the physical topology.
  • Source Node12
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 1, 8) to the Virtual Link's (12, 4, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node4
    110 Node4→Node12
    (4,12,0)
    37.698 2.302 Shortest path: [Node4, Node5, Node12]

    Shortest path: [4, 5, 12]
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 1, 9) to the Virtual Link's (4, 12, 0) routing over the physical topology.
  • Source Node4
    Link 13 : Node5→Node12 1036.0 1
  • Appended the Physical Link: (5, 12, 0, 11) to the Virtual Link's (4, 12, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node12
    111 Node8→Node3
    (8,3,0)
    31.647 8.353 Shortest path: [Node8, Node7, Node6, Node4, Node3]

    Shortest path: [8, 7, 6, 4, 3]
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 2, 0) to the Virtual Link's (8, 3, 0) routing over the physical topology.
  • Source Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 2, 2) to the Virtual Link's (8, 3, 0) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 1, 14) to the Virtual Link's (8, 3, 0) routing over the physical topology.
  • Middle Node6
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 1, 6) to the Virtual Link's (8, 3, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node3
    112 Node9→Node11
    (9,11,0)
    32.526 7.474 Shortest path: [Node9, Node8, Node11]

    Shortest path: [9, 8, 11]
    Link 14 : Node9→Node8 752.0 1
  • Appended the Physical Link: (9, 8, 0, 7) to the Virtual Link's (9, 11, 0) routing over the physical topology.
  • Source Node9
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 0, 15) to the Virtual Link's (9, 11, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node11
    113 Node6→Node1
    (6,1,0)
    37.136 2.864 Shortest path: [Node6, Node7, Node1]

    Shortest path: [6, 7, 1]
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 2, 3) to the Virtual Link's (6, 1, 0) routing over the physical topology.
  • Source Node6
    Link 4 : Node7→Node1 868.0 1
  • Appended the Physical Link: (7, 1, 0, 6) to the Virtual Link's (6, 1, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node1
    114 Node12→Node2
    (12,2,0)
    39.496 0.504 Shortest path: [Node12, Node5, Node2]

    Shortest path: [12, 5, 2]
    Link 13 : Node12→Node5 1036.0 1
  • Appended the Physical Link: (12, 5, 0, 12) to the Virtual Link's (12, 2, 0) routing over the physical topology.
  • Source Node12
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 1, 1) to the Virtual Link's (12, 2, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node2
    115 Node10→Node7
    (10,7,0)
    38.869 1.131 Shortest path: [Node10, Node11, Node8, Node7]

    Shortest path: [10, 11, 8, 7]
    Link 17 : Node10→Node11 408.0 1
  • Appended the Physical Link: (10, 11, 0, 6) to the Virtual Link's (10, 7, 0) routing over the physical topology.
  • Source Node10
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 1, 0) to the Virtual Link's (10, 7, 0) routing over the physical topology.
  • Middle Node11
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 2, 1) to the Virtual Link's (10, 7, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node7
    116 Node2→Node1
    (2,1,0)
    38.932 1.068 Shortest path: [Node2, Node1]

    Shortest path: [2, 1]
    Link 2 : Node2→Node1 380.0 1
  • Appended the Physical Link: (2, 1, 0, 2) to the Virtual Link's (2, 1, 0) routing over the physical topology.
  • Source Node2
    -- 0 no wavelength id Destination Node1
    117 Node6→Node12
    (6,12,0)
    38.599 1.401 Shortest path: [Node6, Node7, Node8, Node13, Node12]

    Shortest path: [6, 7, 8, 13, 12]
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 2, 4) to the Virtual Link's (6, 12, 0) routing over the physical topology.
  • Source Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 2, 2) to the Virtual Link's (6, 12, 0) routing over the physical topology.
  • Middle Node7
    Link 16 : Node8→Node13 668.0 1
  • Appended the Physical Link: (8, 13, 0, 14) to the Virtual Link's (6, 12, 0) routing over the physical topology.
  • Middle Node8
    Link 20 : Node13→Node12 352.0 1
  • Appended the Physical Link: (13, 12, 0, 13) to the Virtual Link's (6, 12, 0) routing over the physical topology.
  • Middle Node13
    -- 0 no wavelength id Destination Node12
    118 Node10→Node3
    (10,3,0)
    39.515 0.485 Shortest path: [Node10, Node3]

    Shortest path: [10, 3]
    Link 11 : Node10→Node3 1140.0 1
  • Appended the Physical Link: (10, 3, 0, 7) to the Virtual Link's (10, 3, 0) routing over the physical topology.
  • Source Node10
    -- 0 no wavelength id Destination Node3
    119 Node0→Node4
    (0,4,0)
    37.197 2.803 Shortest path: [Node0, Node3, Node4]

    Shortest path: [0, 3, 4]
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 0, 11) to the Virtual Link's (0, 4, 0) routing over the physical topology.
  • Source Node0
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 1, 7) to the Virtual Link's (0, 4, 0) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node4
    120 Node9→Node5
    (9,5,0)
    31.757 8.243 Shortest path: [Node9, Node5]

    Shortest path: [9, 5]
    Link 12 : Node9→Node5 704.0 1
  • Appended the Physical Link: (9, 5, 0, 7) to the Virtual Link's (9, 5, 0) routing over the physical topology.
  • Source Node9
    -- 0 no wavelength id Destination Node5
    121 Node3→Node11
    (3,11,0)
    36.742 3.258 Shortest path: [Node3, Node4, Node6, Node7, Node8, Node11]

    Shortest path: [3, 4, 6, 7, 8, 11]
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 1, 8) to the Virtual Link's (3, 11, 0) routing over the physical topology.
  • Source Node3
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 1, 15) to the Virtual Link's (3, 11, 0) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 2, 5) to the Virtual Link's (3, 11, 0) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 2, 3) to the Virtual Link's (3, 11, 0) routing over the physical topology.
  • Middle Node7
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 1, 1) to the Virtual Link's (3, 11, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node11
    122 Node3→Node0
    (3,0,0)
    36.23 3.77 Shortest path: [Node3, Node0]

    Shortest path: [3, 0]
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 0, 12) to the Virtual Link's (3, 0, 0) routing over the physical topology.
  • Source Node3
    -- 0 no wavelength id Destination Node0
    123 Node7→Node11
    (7,11,0)
    35.857 4.143 Shortest path: [Node7, Node8, Node11]

    Shortest path: [7, 8, 11]
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 2, 4) to the Virtual Link's (7, 11, 0) routing over the physical topology.
  • Source Node7
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 1, 2) to the Virtual Link's (7, 11, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node11
    124 Node11→Node0
    (11,0,0)
    36.069 3.931 Shortest path: [Node11, Node8, Node7, Node6, Node4, Node3, Node0]

    Shortest path: [11, 8, 7, 6, 4, 3, 0]
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 1, 3) to the Virtual Link's (11, 0, 0) routing over the physical topology.
  • Source Node11
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 2, 5) to the Virtual Link's (11, 0, 0) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 2, 6) to the Virtual Link's (11, 0, 0) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 2, 0) to the Virtual Link's (11, 0, 0) routing over the physical topology.
  • Middle Node6
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 1, 9) to the Virtual Link's (11, 0, 0) routing over the physical topology.
  • Middle Node4
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 0, 13) to the Virtual Link's (11, 0, 0) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node0
    125 Node6→Node2
    (6,2,0)
    38.795 1.205 Shortest path: [Node6, Node4, Node5, Node2]

    Shortest path: [6, 4, 5, 2]
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 2, 1) to the Virtual Link's (6, 2, 0) routing over the physical topology.
  • Source Node6
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 1, 10) to the Virtual Link's (6, 2, 0) routing over the physical topology.
  • Middle Node4
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 1, 2) to the Virtual Link's (6, 2, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node2
    126 Node12→Node1
    (12,1,0)
    39.6 0.4 Shortest path: [Node12, Node5, Node2, Node1]

    Shortest path: [12, 5, 2, 1]
    Link 13 : Node12→Node5 1036.0 1
  • Appended the Physical Link: (12, 5, 0, 13) to the Virtual Link's (12, 1, 0) routing over the physical topology.
  • Source Node12
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 1, 3) to the Virtual Link's (12, 1, 0) routing over the physical topology.
  • Middle Node5
    Link 2 : Node2→Node1 380.0 1
  • Appended the Physical Link: (2, 1, 0, 3) to the Virtual Link's (12, 1, 0) routing over the physical topology.
  • Middle Node2
    -- 0 no wavelength id Destination Node1
    127 Node6→Node5
    (6,5,0)
    38.743 1.257 Shortest path: [Node6, Node4, Node5]

    Shortest path: [6, 4, 5]
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 2, 2) to the Virtual Link's (6, 5, 0) routing over the physical topology.
  • Source Node6
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 1, 11) to the Virtual Link's (6, 5, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node5
    128 Node5→Node6
    (5,6,0)
    39.901 0.099 Shortest path: [Node5, Node4, Node6]

    Shortest path: [5, 4, 6]
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 1, 12) to the Virtual Link's (5, 6, 0) routing over the physical topology.
  • Source Node5
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 2, 3) to the Virtual Link's (5, 6, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node6
    129 Node9→Node12
    (9,12,0)
    39.032 0.968 Shortest path: [Node9, Node5, Node12]

    Shortest path: [9, 5, 12]
    Link 12 : Node9→Node5 704.0 1
  • Appended the Physical Link: (9, 5, 0, 8) to the Virtual Link's (9, 12, 0) routing over the physical topology.
  • Source Node9
    Link 13 : Node5→Node12 1036.0 1
  • Appended the Physical Link: (5, 12, 0, 14) to the Virtual Link's (9, 12, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node12
    130 Node12→Node6
    (12,6,0)
    39.276 0.724 Shortest path: [Node12, Node13, Node8, Node7, Node6]

    Shortest path: [12, 13, 8, 7, 6]
    Link 20 : Node12→Node13 352.0 1
  • Appended the Physical Link: (12, 13, 0, 14) to the Virtual Link's (12, 6, 0) routing over the physical topology.
  • Source Node12
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 0, 15) to the Virtual Link's (12, 6, 0) routing over the physical topology.
  • Middle Node13
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 2, 6) to the Virtual Link's (12, 6, 0) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 2, 7) to the Virtual Link's (12, 6, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node6
    131 Node7→Node8
    (7,8,0)
    39.303 0.697 Shortest path: [Node7, Node8]

    Shortest path: [7, 8]
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 2, 7) to the Virtual Link's (7, 8, 0) routing over the physical topology.
  • Source Node7
    -- 0 no wavelength id Destination Node8
    132 Node10→Node6
    (10,6,0)
    37.728 2.272 Shortest path: [Node10, Node11, Node8, Node7, Node6]

    Shortest path: [10, 11, 8, 7, 6]
    Link 17 : Node10→Node11 408.0 1
  • Appended the Physical Link: (10, 11, 0, 7) to the Virtual Link's (10, 6, 0) routing over the physical topology.
  • Source Node10
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 1, 4) to the Virtual Link's (10, 6, 0) routing over the physical topology.
  • Middle Node11
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 2, 8) to the Virtual Link's (10, 6, 0) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 2, 8) to the Virtual Link's (10, 6, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node6
    133 Node8→Node1
    (8,1,0)
    37.779 2.221 Shortest path: [Node8, Node7, Node1]

    Shortest path: [8, 7, 1]
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 2, 9) to the Virtual Link's (8, 1, 0) routing over the physical topology.
  • Source Node8
    Link 4 : Node7→Node1 868.0 1
  • Appended the Physical Link: (7, 1, 0, 7) to the Virtual Link's (8, 1, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node1
    134 Node9→Node0
    (9,0,0)
    39.73 0.27 Shortest path: [Node9, Node5, Node2, Node0]

    Shortest path: [9, 5, 2, 0]
    Link 12 : Node9→Node5 704.0 1
  • Appended the Physical Link: (9, 5, 0, 9) to the Virtual Link's (9, 0, 0) routing over the physical topology.
  • Source Node9
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 1, 4) to the Virtual Link's (9, 0, 0) routing over the physical topology.
  • Middle Node5
    Link 1 : Node2→Node0 252.0 1
  • Appended the Physical Link: (2, 0, 0, 5) to the Virtual Link's (9, 0, 0) routing over the physical topology.
  • Middle Node2
    -- 0 no wavelength id Destination Node0
    135 Node10→Node1
    (10,1,0)
    39.224 0.776 Shortest path: [Node10, Node3, Node0, Node1]

    Shortest path: [10, 3, 0, 1]
    Link 11 : Node10→Node3 1140.0 1
  • Appended the Physical Link: (10, 3, 0, 8) to the Virtual Link's (10, 1, 0) routing over the physical topology.
  • Source Node10
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 0, 14) to the Virtual Link's (10, 1, 0) routing over the physical topology.
  • Middle Node3
    Link 0 : Node0→Node1 260.0 1
  • Appended the Physical Link: (0, 1, 0, 4) to the Virtual Link's (10, 1, 0) routing over the physical topology.
  • Middle Node0
    -- 0 no wavelength id Destination Node1
    136 Node7→Node10
    (7,10,0)
    36.586 3.414 Shortest path: [Node7, Node8, Node11, Node10]

    Shortest path: [7, 8, 11, 10]
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 2, 10) to the Virtual Link's (7, 10, 0) routing over the physical topology.
  • Source Node7
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 1, 5) to the Virtual Link's (7, 10, 0) routing over the physical topology.
  • Middle Node8
    Link 17 : Node11→Node10 408.0 1
  • Appended the Physical Link: (11, 10, 0, 8) to the Virtual Link's (7, 10, 0) routing over the physical topology.
  • Middle Node11
    -- 0 no wavelength id Destination Node10
    137 Node9→Node1
    (9,1,0)
    39.321 0.679 Shortest path: [Node9, Node5, Node2, Node1]

    Shortest path: [9, 5, 2, 1]
    Link 12 : Node9→Node5 704.0 1
  • Appended the Physical Link: (9, 5, 0, 10) to the Virtual Link's (9, 1, 0) routing over the physical topology.
  • Source Node9
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 1, 5) to the Virtual Link's (9, 1, 0) routing over the physical topology.
  • Middle Node5
    Link 2 : Node2→Node1 380.0 1
  • Appended the Physical Link: (2, 1, 0, 4) to the Virtual Link's (9, 1, 0) routing over the physical topology.
  • Middle Node2
    -- 0 no wavelength id Destination Node1
    138 Node5→Node9
    (5,9,0)
    39.291 0.709 Shortest path: [Node5, Node9]

    Shortest path: [5, 9]
    Link 12 : Node5→Node9 704.0 1
  • Appended the Physical Link: (5, 9, 0, 11) to the Virtual Link's (5, 9, 0) routing over the physical topology.
  • Source Node5
    -- 0 no wavelength id Destination Node9
    139 Node0→Node3
    (0,3,0)
    38.879 1.121 Shortest path: [Node0, Node3]

    Shortest path: [0, 3]
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 0, 15) to the Virtual Link's (0, 3, 0) routing over the physical topology.
  • Source Node0
    -- 0 no wavelength id Destination Node3
    140 Node9→Node8
    (9,8,0)
    36.31 3.69 Shortest path: [Node9, Node8]

    Shortest path: [9, 8]
    Link 14 : Node9→Node8 752.0 1
  • Appended the Physical Link: (9, 8, 0, 8) to the Virtual Link's (9, 8, 0) routing over the physical topology.
  • Source Node9
    -- 0 no wavelength id Destination Node8
    141 Node10→Node5
    (10,5,0)
    35.54 4.46 Shortest path: [Node10, Node3, Node4, Node5]

    Shortest path: [10, 3, 4, 5]
    Link 11 : Node10→Node3 1140.0 1
  • Appended the Physical Link: (10, 3, 0, 9) to the Virtual Link's (10, 5, 0) routing over the physical topology.
  • Source Node10
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 1, 10) to the Virtual Link's (10, 5, 0) routing over the physical topology.
  • Middle Node3
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 1, 13) to the Virtual Link's (10, 5, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node5
    142 Node11→Node9
    (11,9,0)
    39.302 0.698 Shortest path: [Node11, Node8, Node9]

    Shortest path: [11, 8, 9]
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 1, 6) to the Virtual Link's (11, 9, 0) routing over the physical topology.
  • Source Node11
    Link 14 : Node8→Node9 752.0 1
  • Appended the Physical Link: (8, 9, 0, 9) to the Virtual Link's (11, 9, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node9
    143 Node0→Node2
    (0,2,0)
    39.633 0.367 Shortest path: [Node0, Node2]

    Shortest path: [0, 2]
    Link 1 : Node0→Node2 252.0 1
  • Appended the Physical Link: (0, 2, 0, 6) to the Virtual Link's (0, 2, 0) routing over the physical topology.
  • Source Node0
    -- 0 no wavelength id Destination Node2
    144 Node7→Node0
    (7,0,0)
    39.967 0.033 Shortest path: [Node7, Node6, Node4, Node3, Node0]

    Shortest path: [7, 6, 4, 3, 0]
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 2, 9) to the Virtual Link's (7, 0, 0) routing over the physical topology.
  • Source Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 2, 4) to the Virtual Link's (7, 0, 0) routing over the physical topology.
  • Middle Node6
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 1, 11) to the Virtual Link's (7, 0, 0) routing over the physical topology.
  • Middle Node4
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 1, 0) to the Virtual Link's (7, 0, 0) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node0
    145 Node4→Node1
    (4,1,0)
    38.503 1.497 Shortest path: [Node4, Node3, Node0, Node1]

    Shortest path: [4, 3, 0, 1]
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 1, 12) to the Virtual Link's (4, 1, 0) routing over the physical topology.
  • Source Node4
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 1, 1) to the Virtual Link's (4, 1, 0) routing over the physical topology.
  • Middle Node3
    Link 0 : Node0→Node1 260.0 1
  • Appended the Physical Link: (0, 1, 0, 5) to the Virtual Link's (4, 1, 0) routing over the physical topology.
  • Middle Node0
    -- 0 no wavelength id Destination Node1
    146 Node6→Node0
    (6,0,0)
    39.43 0.57 Shortest path: [Node6, Node4, Node3, Node0]

    Shortest path: [6, 4, 3, 0]
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 2, 5) to the Virtual Link's (6, 0, 0) routing over the physical topology.
  • Source Node6
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 1, 13) to the Virtual Link's (6, 0, 0) routing over the physical topology.
  • Middle Node4
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 1, 2) to the Virtual Link's (6, 0, 0) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node0
    147 Node4→Node8
    (4,8,0)
    28.724 11.276 Shortest path: [Node4, Node6, Node7, Node8]

    Shortest path: [4, 6, 7, 8]
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 2, 6) to the Virtual Link's (4, 8, 0) routing over the physical topology.
  • Source Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 2, 10) to the Virtual Link's (4, 8, 0) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 2, 11) to the Virtual Link's (4, 8, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node8
    148 Node12→Node7
    (12,7,0)
    39.785 0.215 Shortest path: [Node12, Node13, Node8, Node7]

    Shortest path: [12, 13, 8, 7]
    Link 20 : Node12→Node13 352.0 1
  • Appended the Physical Link: (12, 13, 0, 15) to the Virtual Link's (12, 7, 0) routing over the physical topology.
  • Source Node12
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 1, 0) to the Virtual Link's (12, 7, 0) routing over the physical topology.
  • Middle Node13
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 2, 12) to the Virtual Link's (12, 7, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node7
    149 Node5→Node4
    (5,4,0)
    38.793 1.207 Shortest path: [Node5, Node4]

    Shortest path: [5, 4]
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 1, 14) to the Virtual Link's (5, 4, 0) routing over the physical topology.
  • Source Node5
    -- 0 no wavelength id Destination Node4
    150 Node0→Node11
    (0,11,0)
    28.471 11.529 Shortest path: [Node0, Node3, Node4, Node6, Node7, Node8, Node11]

    Shortest path: [0, 3, 4, 6, 7, 8, 11]
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 1, 3) to the Virtual Link's (0, 11, 0) routing over the physical topology.
  • Source Node0
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 1, 14) to the Virtual Link's (0, 11, 0) routing over the physical topology.
  • Middle Node3
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 2, 7) to the Virtual Link's (0, 11, 0) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 2, 11) to the Virtual Link's (0, 11, 0) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 2, 13) to the Virtual Link's (0, 11, 0) routing over the physical topology.
  • Middle Node7
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 1, 7) to the Virtual Link's (0, 11, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node11
    151 Node0→Node12
    (0,12,0)
    38.576 1.424 Shortest path: [Node0, Node2, Node5, Node12]

    Shortest path: [0, 2, 5, 12]
    Link 1 : Node0→Node2 252.0 1
  • Appended the Physical Link: (0, 2, 0, 7) to the Virtual Link's (0, 12, 0) routing over the physical topology.
  • Source Node0
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 1, 6) to the Virtual Link's (0, 12, 0) routing over the physical topology.
  • Middle Node2
    Link 13 : Node5→Node12 1036.0 1
  • Appended the Physical Link: (5, 12, 0, 15) to the Virtual Link's (0, 12, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node12
    152 Node2→Node5
    (2,5,0)
    30.738 9.262 Shortest path: [Node2, Node5]

    Shortest path: [2, 5]
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 1, 7) to the Virtual Link's (2, 5, 0) routing over the physical topology.
  • Source Node2
    -- 0 no wavelength id Destination Node5
    153 Node3→Node2
    (3,2,0)
    38.694 1.306 Shortest path: [Node3, Node0, Node2]

    Shortest path: [3, 0, 2]
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 1, 4) to the Virtual Link's (3, 2, 0) routing over the physical topology.
  • Source Node3
    Link 1 : Node0→Node2 252.0 1
  • Appended the Physical Link: (0, 2, 0, 8) to the Virtual Link's (3, 2, 0) routing over the physical topology.
  • Middle Node0
    -- 0 no wavelength id Destination Node2
    154 Node7→Node13
    (7,13,0)
    39.888 0.112 Shortest path: [Node7, Node8, Node13]

    Shortest path: [7, 8, 13]
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 2, 14) to the Virtual Link's (7, 13, 0) routing over the physical topology.
  • Source Node7
    Link 16 : Node8→Node13 668.0 1
  • Appended the Physical Link: (8, 13, 1, 1) to the Virtual Link's (7, 13, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node13
    155 Node1→Node13
    (1,13,0)
    33.292 6.708 Shortest path: [Node1, Node7, Node8, Node13]

    Shortest path: [1, 7, 8, 13]
    Link 4 : Node1→Node7 868.0 1
  • Appended the Physical Link: (1, 7, 0, 8) to the Virtual Link's (1, 13, 0) routing over the physical topology.
  • Source Node1
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 2, 15) to the Virtual Link's (1, 13, 0) routing over the physical topology.
  • Middle Node7
    Link 16 : Node8→Node13 668.0 1
  • Appended the Physical Link: (8, 13, 1, 2) to the Virtual Link's (1, 13, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node13
    156 Node8→Node13
    (8,13,0)
    39.97 0.03 Shortest path: [Node8, Node13]

    Shortest path: [8, 13]
    Link 16 : Node8→Node13 668.0 1
  • Appended the Physical Link: (8, 13, 1, 3) to the Virtual Link's (8, 13, 0) routing over the physical topology.
  • Source Node8
    -- 0 no wavelength id Destination Node13
    157 Node1→Node12
    (1,12,0)
    34.502 5.498 Shortest path: [Node1, Node2, Node5, Node12]

    Shortest path: [1, 2, 5, 12]
    Link 2 : Node1→Node2 380.0 1
  • Appended the Physical Link: (1, 2, 0, 5) to the Virtual Link's (1, 12, 0) routing over the physical topology.
  • Source Node1
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 1, 8) to the Virtual Link's (1, 12, 0) routing over the physical topology.
  • Middle Node2
    Link 13 : Node5→Node12 1036.0 1
  • Appended the Physical Link: (5, 12, 1, 0) to the Virtual Link's (1, 12, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node12
    158 Node6→Node11
    (6,11,0)
    35.632 4.368 Shortest path: [Node6, Node7, Node8, Node11]

    Shortest path: [6, 7, 8, 11]
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 2, 12) to the Virtual Link's (6, 11, 0) routing over the physical topology.
  • Source Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 3, 0) to the Virtual Link's (6, 11, 0) routing over the physical topology.
  • Middle Node7
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 1, 8) to the Virtual Link's (6, 11, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node11
    159 Node2→Node10
    (2,10,0)
    38.462 1.538 Shortest path: [Node2, Node0, Node3, Node10]

    Shortest path: [2, 0, 3, 10]
    Link 1 : Node2→Node0 252.0 1
  • Appended the Physical Link: (2, 0, 0, 9) to the Virtual Link's (2, 10, 0) routing over the physical topology.
  • Source Node2
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 1, 5) to the Virtual Link's (2, 10, 0) routing over the physical topology.
  • Middle Node0
    Link 11 : Node3→Node10 1140.0 1
  • Appended the Physical Link: (3, 10, 0, 10) to the Virtual Link's (2, 10, 0) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node10
    160 Node2→Node8
    (2,8,0)
    39.624 0.376 Shortest path: [Node2, Node5, Node4, Node6, Node7, Node8]

    Shortest path: [2, 5, 4, 6, 7, 8]
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 1, 9) to the Virtual Link's (2, 8, 0) routing over the physical topology.
  • Source Node2
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 1, 15) to the Virtual Link's (2, 8, 0) routing over the physical topology.
  • Middle Node5
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 2, 8) to the Virtual Link's (2, 8, 0) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 2, 13) to the Virtual Link's (2, 8, 0) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 3, 1) to the Virtual Link's (2, 8, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node8
    161 Node9→Node2
    (9,2,0)
    39.886 0.114 Shortest path: [Node9, Node5, Node2]

    Shortest path: [9, 5, 2]
    Link 12 : Node9→Node5 704.0 1
  • Appended the Physical Link: (9, 5, 0, 12) to the Virtual Link's (9, 2, 0) routing over the physical topology.
  • Source Node9
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 1, 10) to the Virtual Link's (9, 2, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node2
    162 Node8→Node6
    (8,6,0)
    36.827 3.173 Shortest path: [Node8, Node7, Node6]

    Shortest path: [8, 7, 6]
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 3, 2) to the Virtual Link's (8, 6, 0) routing over the physical topology.
  • Source Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 2, 14) to the Virtual Link's (8, 6, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node6
    163 Node12→Node11
    (12,11,0)
    39.42 0.58 Shortest path: [Node12, Node11]

    Shortest path: [12, 11]
    Link 18 : Node12→Node11 664.0 1
  • Appended the Physical Link: (12, 11, 0, 3) to the Virtual Link's (12, 11, 0) routing over the physical topology.
  • Source Node12
    -- 0 no wavelength id Destination Node11
    164 Node9→Node6
    (9,6,0)
    37.511 2.489 Shortest path: [Node9, Node8, Node7, Node6]

    Shortest path: [9, 8, 7, 6]
    Link 14 : Node9→Node8 752.0 1
  • Appended the Physical Link: (9, 8, 0, 10) to the Virtual Link's (9, 6, 0) routing over the physical topology.
  • Source Node9
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 3, 3) to the Virtual Link's (9, 6, 0) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 2, 15) to the Virtual Link's (9, 6, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node6
    165 Node0→Node5
    (0,5,0)
    36.768 3.232 Shortest path: [Node0, Node2, Node5]

    Shortest path: [0, 2, 5]
    Link 1 : Node0→Node2 252.0 1
  • Appended the Physical Link: (0, 2, 0, 10) to the Virtual Link's (0, 5, 0) routing over the physical topology.
  • Source Node0
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 1, 11) to the Virtual Link's (0, 5, 0) routing over the physical topology.
  • Middle Node2
    -- 0 no wavelength id Destination Node5
    166 Node11→Node3
    (11,3,0)
    38.833 1.167 Shortest path: [Node11, Node8, Node7, Node6, Node4, Node3]

    Shortest path: [11, 8, 7, 6, 4, 3]
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 1, 9) to the Virtual Link's (11, 3, 0) routing over the physical topology.
  • Source Node11
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 3, 4) to the Virtual Link's (11, 3, 0) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 3, 0) to the Virtual Link's (11, 3, 0) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 2, 9) to the Virtual Link's (11, 3, 0) routing over the physical topology.
  • Middle Node6
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 1, 15) to the Virtual Link's (11, 3, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node3
    167 Node1→Node10
    (1,10,0)
    28.937 11.063 Shortest path: [Node1, Node0, Node3, Node10]

    Shortest path: [1, 0, 3, 10]
    Link 0 : Node1→Node0 260.0 1
  • Appended the Physical Link: (1, 0, 0, 6) to the Virtual Link's (1, 10, 0) routing over the physical topology.
  • Source Node1
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 1, 6) to the Virtual Link's (1, 10, 0) routing over the physical topology.
  • Middle Node0
    Link 11 : Node3→Node10 1140.0 1
  • Appended the Physical Link: (3, 10, 0, 11) to the Virtual Link's (1, 10, 0) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node10
    168 Node4→Node0
    (4,0,0)
    39.926 0.074 Shortest path: [Node4, Node3, Node0]

    Shortest path: [4, 3, 0]
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 2, 0) to the Virtual Link's (4, 0, 0) routing over the physical topology.
  • Source Node4
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 1, 7) to the Virtual Link's (4, 0, 0) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node0
    169 Node2→Node0
    (2,0,0)
    38.998 1.002 Shortest path: [Node2, Node0]

    Shortest path: [2, 0]
    Link 1 : Node2→Node0 252.0 1
  • Appended the Physical Link: (2, 0, 0, 11) to the Virtual Link's (2, 0, 0) routing over the physical topology.
  • Source Node2
    -- 0 no wavelength id Destination Node0
    170 Node1→Node9
    (1,9,0)
    37.876 2.124 Shortest path: [Node1, Node2, Node5, Node9]

    Shortest path: [1, 2, 5, 9]
    Link 2 : Node1→Node2 380.0 1
  • Appended the Physical Link: (1, 2, 0, 6) to the Virtual Link's (1, 9, 0) routing over the physical topology.
  • Source Node1
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 1, 12) to the Virtual Link's (1, 9, 0) routing over the physical topology.
  • Middle Node2
    Link 12 : Node5→Node9 704.0 1
  • Appended the Physical Link: (5, 9, 0, 13) to the Virtual Link's (1, 9, 0) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node9
    171 Node3→Node7
    (3,7,0)
    29.337 10.663 Shortest path: [Node3, Node4, Node6, Node7]

    Shortest path: [3, 4, 6, 7]
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 2, 1) to the Virtual Link's (3, 7, 0) routing over the physical topology.
  • Source Node3
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 2, 10) to the Virtual Link's (3, 7, 0) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 3, 1) to the Virtual Link's (3, 7, 0) routing over the physical topology.
  • Middle Node6
    -- 0 no wavelength id Destination Node7
    172 Node9→Node13
    (9,13,0)
    34.99 5.01 Shortest path: [Node9, Node8, Node13]

    Shortest path: [9, 8, 13]
    Link 14 : Node9→Node8 752.0 1
  • Appended the Physical Link: (9, 8, 0, 11) to the Virtual Link's (9, 13, 0) routing over the physical topology.
  • Source Node9
    Link 16 : Node8→Node13 668.0 1
  • Appended the Physical Link: (8, 13, 1, 4) to the Virtual Link's (9, 13, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node13
    173 Node8→Node0
    (8,0,0)
    39.192 0.808 Shortest path: [Node8, Node7, Node6, Node4, Node3, Node0]

    Shortest path: [8, 7, 6, 4, 3, 0]
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 3, 5) to the Virtual Link's (8, 0, 0) routing over the physical topology.
  • Source Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 3, 2) to the Virtual Link's (8, 0, 0) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 2, 11) to the Virtual Link's (8, 0, 0) routing over the physical topology.
  • Middle Node6
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 2, 2) to the Virtual Link's (8, 0, 0) routing over the physical topology.
  • Middle Node4
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 1, 8) to the Virtual Link's (8, 0, 0) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node0
    174 Node13→Node7
    (13,7,0)
    34.292 5.708 Shortest path: [Node13, Node8, Node7]

    Shortest path: [13, 8, 7]
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 1, 5) to the Virtual Link's (13, 7, 0) routing over the physical topology.
  • Source Node13
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 3, 6) to the Virtual Link's (13, 7, 0) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node7
    175 Node8→Node10
    (8,10,0)
    34.599 5.401 Shortest path: [Node8, Node11, Node10]

    Shortest path: [8, 11, 10]
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 1, 10) to the Virtual Link's (8, 10, 0) routing over the physical topology.
  • Source Node8
    Link 17 : Node11→Node10 408.0 1
  • Appended the Physical Link: (11, 10, 0, 9) to the Virtual Link's (8, 10, 0) routing over the physical topology.
  • Middle Node11
    -- 0 no wavelength id Destination Node10
    176 Node1→Node5
    (1,5,0)
    29.196 10.804 Shortest path: [Node1, Node2, Node5]

    Shortest path: [1, 2, 5]
    Link 2 : Node1→Node2 380.0 1
  • Appended the Physical Link: (1, 2, 0, 7) to the Virtual Link's (1, 5, 0) routing over the physical topology.
  • Source Node1
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 1, 13) to the Virtual Link's (1, 5, 0) routing over the physical topology.
  • Middle Node2
    -- 0 no wavelength id Destination Node5
    177 Node12→Node5
    (12,5,0)
    39.166 0.834 Shortest path: [Node12, Node5]

    Shortest path: [12, 5]
    Link 13 : Node12→Node5 1036.0 1
  • Appended the Physical Link: (12, 5, 1, 1) to the Virtual Link's (12, 5, 0) routing over the physical topology.
  • Source Node12
    -- 0 no wavelength id Destination Node5
    178 Node11→Node8
    (11,8,0)
    38.415 1.585 Shortest path: [Node11, Node8]

    Shortest path: [11, 8]
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 1, 11) to the Virtual Link's (11, 8, 0) routing over the physical topology.
  • Source Node11
    -- 0 no wavelength id Destination Node8
    179 Node1→Node8
    (1,8,0)
    37.069 2.931 Shortest path: [Node1, Node7, Node8]

    Shortest path: [1, 7, 8]
    Link 4 : Node1→Node7 868.0 1
  • Appended the Physical Link: (1, 7, 0, 9) to the Virtual Link's (1, 8, 0) routing over the physical topology.
  • Source Node1
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 3, 7) to the Virtual Link's (1, 8, 0) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node8
    180 Node7→Node4
    (7,4,0)
    36.652 3.348 Shortest path: [Node7, Node6, Node4]

    Shortest path: [7, 6, 4]
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 3, 3) to the Virtual Link's (7, 4, 0) routing over the physical topology.
  • Source Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 2, 12) to the Virtual Link's (7, 4, 0) routing over the physical topology.
  • Middle Node6
    -- 0 no wavelength id Destination Node4
    181 Node3→Node6
    (3,6,0)
    35.262 4.738 Shortest path: [Node3, Node4, Node6]

    Shortest path: [3, 4, 6]
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 2, 3) to the Virtual Link's (3, 6, 0) routing over the physical topology.
  • Source Node3
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 2, 13) to the Virtual Link's (3, 6, 0) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node6
    182 Node1→Node3
    (1,3,0)
    38.229 1.771 Shortest path: [Node1, Node0, Node3]

    Shortest path: [1, 0, 3]
    Link 0 : Node1→Node0 260.0 1
  • Appended the Physical Link: (1, 0, 0, 7) to the Virtual Link's (1, 3, 0) routing over the physical topology.
  • Source Node1
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 1, 9) to the Virtual Link's (1, 3, 0) routing over the physical topology.
  • Middle Node0
    -- 0 no wavelength id Destination Node3
    183 Node0→Node12
    (0,12,1)
    34.926 5.074 Shortest path: [Node0, Node2, Node5, Node12]

    Shortest path: [0, 2, 5, 12]
    Link 1 : Node0→Node2 252.0 1
  • Appended the Physical Link: (0, 2, 0, 12) to the Virtual Link's (0, 12, 1) routing over the physical topology.
  • Source Node0
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 1, 14) to the Virtual Link's (0, 12, 1) routing over the physical topology.
  • Middle Node2
    Link 13 : Node5→Node12 1036.0 1
  • Appended the Physical Link: (5, 12, 1, 2) to the Virtual Link's (0, 12, 1) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node12
    184 Node13→Node8
    (13,8,1)
    34.82 5.18 Shortest path: [Node13, Node8]

    Shortest path: [13, 8]
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 1, 6) to the Virtual Link's (13, 8, 1) routing over the physical topology.
  • Source Node13
    -- 0 no wavelength id Destination Node8
    185 Node13→Node9
    (13,9,1)
    34.296 5.704 Shortest path: [Node13, Node8, Node9]

    Shortest path: [13, 8, 9]
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 1, 7) to the Virtual Link's (13, 9, 1) routing over the physical topology.
  • Source Node13
    Link 14 : Node8→Node9 752.0 1
  • Appended the Physical Link: (8, 9, 0, 12) to the Virtual Link's (13, 9, 1) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node9
    186 Node8→Node4
    (8,4,1)
    34.291 5.709 Shortest path: [Node8, Node7, Node6, Node4]

    Shortest path: [8, 7, 6, 4]
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 3, 8) to the Virtual Link's (8, 4, 1) routing over the physical topology.
  • Source Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 3, 4) to the Virtual Link's (8, 4, 1) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 2, 14) to the Virtual Link's (8, 4, 1) routing over the physical topology.
  • Middle Node6
    -- 0 no wavelength id Destination Node4
    187 Node7→Node11
    (7,11,1)
    34.015 5.985 Shortest path: [Node7, Node8, Node11]

    Shortest path: [7, 8, 11]
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 3, 9) to the Virtual Link's (7, 11, 1) routing over the physical topology.
  • Source Node7
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 1, 12) to the Virtual Link's (7, 11, 1) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node11
    188 Node12→Node3
    (12,3,1)
    32.899 7.101 Shortest path: [Node12, Node5, Node4, Node3]

    Shortest path: [12, 5, 4, 3]
    Link 13 : Node12→Node5 1036.0 1
  • Appended the Physical Link: (12, 5, 1, 3) to the Virtual Link's (12, 3, 1) routing over the physical topology.
  • Source Node12
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 2, 0) to the Virtual Link's (12, 3, 1) routing over the physical topology.
  • Middle Node5
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 2, 4) to the Virtual Link's (12, 3, 1) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node3
    189 Node10→Node4
    (10,4,1)
    32.788 7.212 Shortest path: [Node10, Node3, Node4]

    Shortest path: [10, 3, 4]
    Link 11 : Node10→Node3 1140.0 1
  • Appended the Physical Link: (10, 3, 0, 12) to the Virtual Link's (10, 4, 1) routing over the physical topology.
  • Source Node10
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 2, 5) to the Virtual Link's (10, 4, 1) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node4
    190 Node8→Node6
    (8,6,1)
    38.03 1.97 Shortest path: [Node8, Node7, Node6]

    Shortest path: [8, 7, 6]
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 3, 10) to the Virtual Link's (8, 6, 1) routing over the physical topology.
  • Source Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 3, 5) to the Virtual Link's (8, 6, 1) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node6
    191 Node10→Node8
    (10,8,1)
    37.846 2.154 Shortest path: [Node10, Node11, Node8]

    Shortest path: [10, 11, 8]
    Link 17 : Node10→Node11 408.0 1
  • Appended the Physical Link: (10, 11, 0, 10) to the Virtual Link's (10, 8, 1) routing over the physical topology.
  • Source Node10
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 1, 13) to the Virtual Link's (10, 8, 1) routing over the physical topology.
  • Middle Node11
    -- 0 no wavelength id Destination Node8
    192 Node2→Node12
    (2,12,1)
    32.246 7.754 Shortest path: [Node2, Node5, Node12]

    Shortest path: [2, 5, 12]
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 1, 15) to the Virtual Link's (2, 12, 1) routing over the physical topology.
  • Source Node2
    Link 13 : Node5→Node12 1036.0 1
  • Appended the Physical Link: (5, 12, 1, 4) to the Virtual Link's (2, 12, 1) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node12
    193 Node8→Node11
    (8,11,1)
    39.265 0.735 Shortest path: [Node8, Node11]

    Shortest path: [8, 11]
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 1, 14) to the Virtual Link's (8, 11, 1) routing over the physical topology.
  • Source Node8
    -- 0 no wavelength id Destination Node11
    194 Node0→Node4
    (0,4,1)
    31.065 8.935 Shortest path: [Node0, Node3, Node4]

    Shortest path: [0, 3, 4]
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 1, 10) to the Virtual Link's (0, 4, 1) routing over the physical topology.
  • Source Node0
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 2, 6) to the Virtual Link's (0, 4, 1) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node4
    195 Node4→Node3
    (4,3,1)
    30.752 9.248 Shortest path: [Node4, Node3]

    Shortest path: [4, 3]
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 2, 7) to the Virtual Link's (4, 3, 1) routing over the physical topology.
  • Source Node4
    -- 0 no wavelength id Destination Node3
    196 Node5→Node3
    (5,3,1)
    30.65 9.35 Shortest path: [Node5, Node4, Node3]

    Shortest path: [5, 4, 3]
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 2, 1) to the Virtual Link's (5, 3, 1) routing over the physical topology.
  • Source Node5
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 2, 8) to the Virtual Link's (5, 3, 1) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node3
    197 Node3→Node13
    (3,13,1)
    39.885 0.115 Shortest path: [Node3, Node4, Node6, Node7, Node8, Node13]

    Shortest path: [3, 4, 6, 7, 8, 13]
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 2, 9) to the Virtual Link's (3, 13, 1) routing over the physical topology.
  • Source Node3
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 2, 15) to the Virtual Link's (3, 13, 1) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 3, 6) to the Virtual Link's (3, 13, 1) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 3, 11) to the Virtual Link's (3, 13, 1) routing over the physical topology.
  • Middle Node7
    Link 16 : Node8→Node13 668.0 1
  • Appended the Physical Link: (8, 13, 1, 8) to the Virtual Link's (3, 13, 1) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node13
    198 Node8→Node1
    (8,1,1)
    39.077 0.923 Shortest path: [Node8, Node7, Node1]

    Shortest path: [8, 7, 1]
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 3, 12) to the Virtual Link's (8, 1, 1) routing over the physical topology.
  • Source Node8
    Link 4 : Node7→Node1 868.0 1
  • Appended the Physical Link: (7, 1, 0, 10) to the Virtual Link's (8, 1, 1) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node1
    199 Node7→Node9
    (7,9,1)
    30.096 9.904 Shortest path: [Node7, Node8, Node9]

    Shortest path: [7, 8, 9]
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 3, 13) to the Virtual Link's (7, 9, 1) routing over the physical topology.
  • Source Node7
    Link 14 : Node8→Node9 752.0 1
  • Appended the Physical Link: (8, 9, 0, 13) to the Virtual Link's (7, 9, 1) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node9
    200 Node0→Node13
    (0,13,1)
    29.793 10.207 Shortest path: [Node0, Node3, Node4, Node6, Node7, Node8, Node13]

    Shortest path: [0, 3, 4, 6, 7, 8, 13]
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 1, 11) to the Virtual Link's (0, 13, 1) routing over the physical topology.
  • Source Node0
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 2, 10) to the Virtual Link's (0, 13, 1) routing over the physical topology.
  • Middle Node3
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 3, 0) to the Virtual Link's (0, 13, 1) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 3, 7) to the Virtual Link's (0, 13, 1) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 3, 14) to the Virtual Link's (0, 13, 1) routing over the physical topology.
  • Middle Node7
    Link 16 : Node8→Node13 668.0 1
  • Appended the Physical Link: (8, 13, 1, 9) to the Virtual Link's (0, 13, 1) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node13
    201 Node2→Node8
    (2,8,1)
    37.906 2.094 Shortest path: [Node2, Node5, Node4, Node6, Node7, Node8]

    Shortest path: [2, 5, 4, 6, 7, 8]
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 2, 0) to the Virtual Link's (2, 8, 1) routing over the physical topology.
  • Source Node2
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 2, 2) to the Virtual Link's (2, 8, 1) routing over the physical topology.
  • Middle Node5
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 3, 1) to the Virtual Link's (2, 8, 1) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 3, 8) to the Virtual Link's (2, 8, 1) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 3, 15) to the Virtual Link's (2, 8, 1) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node8
    202 Node7→Node10
    (7,10,1)
    38.977 1.023 Shortest path: [Node7, Node8, Node11, Node10]

    Shortest path: [7, 8, 11, 10]
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 4, 0) to the Virtual Link's (7, 10, 1) routing over the physical topology.
  • Source Node7
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 1, 15) to the Virtual Link's (7, 10, 1) routing over the physical topology.
  • Middle Node8
    Link 17 : Node11→Node10 408.0 1
  • Appended the Physical Link: (11, 10, 0, 11) to the Virtual Link's (7, 10, 1) routing over the physical topology.
  • Middle Node11
    -- 0 no wavelength id Destination Node10
    203 Node7→Node2
    (7,2,1)
    29.346 10.654 Shortest path: [Node7, Node6, Node4, Node5, Node2]

    Shortest path: [7, 6, 4, 5, 2]
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 3, 9) to the Virtual Link's (7, 2, 1) routing over the physical topology.
  • Source Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 3, 2) to the Virtual Link's (7, 2, 1) routing over the physical topology.
  • Middle Node6
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 2, 3) to the Virtual Link's (7, 2, 1) routing over the physical topology.
  • Middle Node4
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 2, 1) to the Virtual Link's (7, 2, 1) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node2
    204 Node6→Node7
    (6,7,1)
    29.278 10.722 Shortest path: [Node6, Node7]

    Shortest path: [6, 7]
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 3, 10) to the Virtual Link's (6, 7, 1) routing over the physical topology.
  • Source Node6
    -- 0 no wavelength id Destination Node7
    205 Node9→Node2
    (9,2,1)
    29.097 10.903 Shortest path: [Node9, Node5, Node2]

    Shortest path: [9, 5, 2]
    Link 12 : Node9→Node5 704.0 1
  • Appended the Physical Link: (9, 5, 0, 14) to the Virtual Link's (9, 2, 1) routing over the physical topology.
  • Source Node9
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 2, 2) to the Virtual Link's (9, 2, 1) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node2
    206 Node4→Node8
    (4,8,1)
    34.426 5.574 Shortest path: [Node4, Node6, Node7, Node8]

    Shortest path: [4, 6, 7, 8]
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 3, 3) to the Virtual Link's (4, 8, 1) routing over the physical topology.
  • Source Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 3, 11) to the Virtual Link's (4, 8, 1) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 4, 1) to the Virtual Link's (4, 8, 1) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node8
    207 Node10→Node7
    (10,7,1)
    39.084 0.916 Shortest path: [Node10, Node11, Node8, Node7]

    Shortest path: [10, 11, 8, 7]
    Link 17 : Node10→Node11 408.0 1
  • Appended the Physical Link: (10, 11, 0, 12) to the Virtual Link's (10, 7, 1) routing over the physical topology.
  • Source Node10
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 2, 0) to the Virtual Link's (10, 7, 1) routing over the physical topology.
  • Middle Node11
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 4, 2) to the Virtual Link's (10, 7, 1) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node7
    208 Node13→Node10
    (13,10,1)
    28.438 11.562 Shortest path: [Node13, Node10]

    Shortest path: [13, 10]
    Link 19 : Node13→Node10 684.0 1
  • Appended the Physical Link: (13, 10, 0, 4) to the Virtual Link's (13, 10, 1) routing over the physical topology.
  • Source Node13
    -- 0 no wavelength id Destination Node10
    209 Node12→Node10
    (12,10,1)
    38.388 1.612 Shortest path: [Node12, Node13, Node10]

    Shortest path: [12, 13, 10]
    Link 20 : Node12→Node13 352.0 1
  • Appended the Physical Link: (12, 13, 1, 0) to the Virtual Link's (12, 10, 1) routing over the physical topology.
  • Source Node12
    Link 19 : Node13→Node10 684.0 1
  • Appended the Physical Link: (13, 10, 0, 5) to the Virtual Link's (12, 10, 1) routing over the physical topology.
  • Middle Node13
    -- 0 no wavelength id Destination Node10
    210 Node2→Node7
    (2,7,1)
    27.771 12.229 Shortest path: [Node2, Node5, Node4, Node6, Node7]

    Shortest path: [2, 5, 4, 6, 7]
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 2, 3) to the Virtual Link's (2, 7, 1) routing over the physical topology.
  • Source Node2
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 2, 4) to the Virtual Link's (2, 7, 1) routing over the physical topology.
  • Middle Node5
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 3, 4) to the Virtual Link's (2, 7, 1) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 3, 12) to the Virtual Link's (2, 7, 1) routing over the physical topology.
  • Middle Node6
    -- 0 no wavelength id Destination Node7
    211 Node2→Node9
    (2,9,1)
    36.732 3.268 Shortest path: [Node2, Node5, Node9]

    Shortest path: [2, 5, 9]
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 2, 4) to the Virtual Link's (2, 9, 1) routing over the physical topology.
  • Source Node2
    Link 12 : Node5→Node9 704.0 1
  • Appended the Physical Link: (5, 9, 0, 15) to the Virtual Link's (2, 9, 1) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node9
    212 Node5→Node9
    (5,9,1)
    33.307 6.693 Shortest path: [Node5, Node9]

    Shortest path: [5, 9]
    Link 12 : Node5→Node9 704.0 1
  • Appended the Physical Link: (5, 9, 1, 0) to the Virtual Link's (5, 9, 1) routing over the physical topology.
  • Source Node5
    -- 0 no wavelength id Destination Node9
    213 Node12→Node8
    (12,8,1)
    39.204 0.796 Shortest path: [Node12, Node13, Node8]

    Shortest path: [12, 13, 8]
    Link 20 : Node12→Node13 352.0 1
  • Appended the Physical Link: (12, 13, 1, 1) to the Virtual Link's (12, 8, 1) routing over the physical topology.
  • Source Node12
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 1, 10) to the Virtual Link's (12, 8, 1) routing over the physical topology.
  • Middle Node13
    -- 0 no wavelength id Destination Node8
    214 Node10→Node1
    (10,1,1)
    27.4 12.6 Shortest path: [Node10, Node3, Node0, Node1]

    Shortest path: [10, 3, 0, 1]
    Link 11 : Node10→Node3 1140.0 1
  • Appended the Physical Link: (10, 3, 0, 13) to the Virtual Link's (10, 1, 1) routing over the physical topology.
  • Source Node10
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 1, 12) to the Virtual Link's (10, 1, 1) routing over the physical topology.
  • Middle Node3
    Link 0 : Node0→Node1 260.0 1
  • Appended the Physical Link: (0, 1, 0, 8) to the Virtual Link's (10, 1, 1) routing over the physical topology.
  • Middle Node0
    -- 0 no wavelength id Destination Node1
    215 Node4→Node9
    (4,9,1)
    27.381 12.619 Shortest path: [Node4, Node5, Node9]

    Shortest path: [4, 5, 9]
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 2, 5) to the Virtual Link's (4, 9, 1) routing over the physical topology.
  • Source Node4
    Link 12 : Node5→Node9 704.0 1
  • Appended the Physical Link: (5, 9, 1, 1) to the Virtual Link's (4, 9, 1) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node9
    216 Node9→Node10
    (9,10,1)
    27.087 12.913 Shortest path: [Node9, Node8, Node11, Node10]

    Shortest path: [9, 8, 11, 10]
    Link 14 : Node9→Node8 752.0 1
  • Appended the Physical Link: (9, 8, 0, 14) to the Virtual Link's (9, 10, 1) routing over the physical topology.
  • Source Node9
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 2, 1) to the Virtual Link's (9, 10, 1) routing over the physical topology.
  • Middle Node8
    Link 17 : Node11→Node10 408.0 1
  • Appended the Physical Link: (11, 10, 0, 13) to the Virtual Link's (9, 10, 1) routing over the physical topology.
  • Middle Node11
    -- 0 no wavelength id Destination Node10
    217 Node10→Node9
    (10,9,1)
    27.053 12.947 Shortest path: [Node10, Node11, Node8, Node9]

    Shortest path: [10, 11, 8, 9]
    Link 17 : Node10→Node11 408.0 1
  • Appended the Physical Link: (10, 11, 0, 14) to the Virtual Link's (10, 9, 1) routing over the physical topology.
  • Source Node10
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 2, 2) to the Virtual Link's (10, 9, 1) routing over the physical topology.
  • Middle Node11
    Link 14 : Node8→Node9 752.0 1
  • Appended the Physical Link: (8, 9, 0, 15) to the Virtual Link's (10, 9, 1) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node9
    218 Node9→Node8
    (9,8,1)
    36.134 3.866 Shortest path: [Node9, Node8]

    Shortest path: [9, 8]
    Link 14 : Node9→Node8 752.0 1
  • Appended the Physical Link: (9, 8, 1, 0) to the Virtual Link's (9, 8, 1) routing over the physical topology.
  • Source Node9
    -- 0 no wavelength id Destination Node8
    219 Node5→Node4
    (5,4,1)
    39.812 0.188 Shortest path: [Node5, Node4]

    Shortest path: [5, 4]
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 2, 6) to the Virtual Link's (5, 4, 1) routing over the physical topology.
  • Source Node5
    -- 0 no wavelength id Destination Node4
    220 Node9→Node12
    (9,12,1)
    31.862 8.138 Shortest path: [Node9, Node5, Node12]

    Shortest path: [9, 5, 12]
    Link 12 : Node9→Node5 704.0 1
  • Appended the Physical Link: (9, 5, 1, 2) to the Virtual Link's (9, 12, 1) routing over the physical topology.
  • Source Node9
    Link 13 : Node5→Node12 1036.0 1
  • Appended the Physical Link: (5, 12, 1, 5) to the Virtual Link's (9, 12, 1) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node12
    221 Node5→Node12
    (5,12,1)
    38.745 1.255 Shortest path: [Node5, Node12]

    Shortest path: [5, 12]
    Link 13 : Node5→Node12 1036.0 1
  • Appended the Physical Link: (5, 12, 1, 6) to the Virtual Link's (5, 12, 1) routing over the physical topology.
  • Source Node5
    -- 0 no wavelength id Destination Node12
    222 Node9→Node7
    (9,7,1)
    37.226 2.774 Shortest path: [Node9, Node8, Node7]

    Shortest path: [9, 8, 7]
    Link 14 : Node9→Node8 752.0 1
  • Appended the Physical Link: (9, 8, 1, 1) to the Virtual Link's (9, 7, 1) routing over the physical topology.
  • Source Node9
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 4, 3) to the Virtual Link's (9, 7, 1) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node7
    223 Node5→Node2
    (5,2,1)
    39.331 0.669 Shortest path: [Node5, Node2]

    Shortest path: [5, 2]
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 2, 5) to the Virtual Link's (5, 2, 1) routing over the physical topology.
  • Source Node5
    -- 0 no wavelength id Destination Node2
    224 Node6→Node1
    (6,1,1)
    36.305 3.695 Shortest path: [Node6, Node7, Node1]

    Shortest path: [6, 7, 1]
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 3, 13) to the Virtual Link's (6, 1, 1) routing over the physical topology.
  • Source Node6
    Link 4 : Node7→Node1 868.0 1
  • Appended the Physical Link: (7, 1, 0, 11) to the Virtual Link's (6, 1, 1) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node1
    225 Node0→Node6
    (0,6,1)
    38.382 1.618 Shortest path: [Node0, Node3, Node4, Node6]

    Shortest path: [0, 3, 4, 6]
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 1, 13) to the Virtual Link's (0, 6, 1) routing over the physical topology.
  • Source Node0
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 2, 11) to the Virtual Link's (0, 6, 1) routing over the physical topology.
  • Middle Node3
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 3, 5) to the Virtual Link's (0, 6, 1) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node6
    226 Node11→Node9
    (11,9,1)
    36.617 3.383 Shortest path: [Node11, Node8, Node9]

    Shortest path: [11, 8, 9]
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 2, 3) to the Virtual Link's (11, 9, 1) routing over the physical topology.
  • Source Node11
    Link 14 : Node8→Node9 752.0 1
  • Appended the Physical Link: (8, 9, 1, 2) to the Virtual Link's (11, 9, 1) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node9
    227 Node2→Node6
    (2,6,1)
    39.218 0.782 Shortest path: [Node2, Node5, Node4, Node6]

    Shortest path: [2, 5, 4, 6]
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 2, 6) to the Virtual Link's (2, 6, 1) routing over the physical topology.
  • Source Node2
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 2, 7) to the Virtual Link's (2, 6, 1) routing over the physical topology.
  • Middle Node5
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 3, 6) to the Virtual Link's (2, 6, 1) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node6
    228 Node13→Node1
    (13,1,1)
    37.202 2.798 Shortest path: [Node13, Node8, Node7, Node1]

    Shortest path: [13, 8, 7, 1]
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 1, 11) to the Virtual Link's (13, 1, 1) routing over the physical topology.
  • Source Node13
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 4, 4) to the Virtual Link's (13, 1, 1) routing over the physical topology.
  • Middle Node8
    Link 4 : Node7→Node1 868.0 1
  • Appended the Physical Link: (7, 1, 0, 12) to the Virtual Link's (13, 1, 1) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node1
    229 Node13→Node11
    (13,11,1)
    39.681 0.319 Shortest path: [Node13, Node12, Node11]

    Shortest path: [13, 12, 11]
    Link 20 : Node13→Node12 352.0 1
  • Appended the Physical Link: (13, 12, 1, 2) to the Virtual Link's (13, 11, 1) routing over the physical topology.
  • Source Node13
    Link 18 : Node12→Node11 664.0 1
  • Appended the Physical Link: (12, 11, 0, 4) to the Virtual Link's (13, 11, 1) routing over the physical topology.
  • Middle Node12
    -- 0 no wavelength id Destination Node11
    230 Node11→Node12
    (11,12,1)
    24.895 15.105 Shortest path: [Node11, Node12]

    Shortest path: [11, 12]
    Link 18 : Node11→Node12 664.0 1
  • Appended the Physical Link: (11, 12, 0, 5) to the Virtual Link's (11, 12, 1) routing over the physical topology.
  • Source Node11
    -- 0 no wavelength id Destination Node12
    231 Node4→Node0
    (4,0,1)
    39.2 0.8 Shortest path: [Node4, Node3, Node0]

    Shortest path: [4, 3, 0]
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 2, 12) to the Virtual Link's (4, 0, 1) routing over the physical topology.
  • Source Node4
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 1, 14) to the Virtual Link's (4, 0, 1) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node0
    232 Node9→Node3
    (9,3,1)
    34.786 5.214 Shortest path: [Node9, Node5, Node4, Node3]

    Shortest path: [9, 5, 4, 3]
    Link 12 : Node9→Node5 704.0 1
  • Appended the Physical Link: (9, 5, 1, 3) to the Virtual Link's (9, 3, 1) routing over the physical topology.
  • Source Node9
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 2, 8) to the Virtual Link's (9, 3, 1) routing over the physical topology.
  • Middle Node5
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 2, 13) to the Virtual Link's (9, 3, 1) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node3
    233 Node6→Node2
    (6,2,1)
    30.357 9.643 Shortest path: [Node6, Node4, Node5, Node2]

    Shortest path: [6, 4, 5, 2]
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 3, 7) to the Virtual Link's (6, 2, 1) routing over the physical topology.
  • Source Node6
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 2, 9) to the Virtual Link's (6, 2, 1) routing over the physical topology.
  • Middle Node4
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 2, 7) to the Virtual Link's (6, 2, 1) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node2
    234 Node2→Node11
    (2,11,1)
    39.738 0.262 Shortest path: [Node2, Node5, Node4, Node6, Node7, Node8, Node11]

    Shortest path: [2, 5, 4, 6, 7, 8, 11]
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 2, 8) to the Virtual Link's (2, 11, 1) routing over the physical topology.
  • Source Node2
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 2, 10) to the Virtual Link's (2, 11, 1) routing over the physical topology.
  • Middle Node5
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 3, 8) to the Virtual Link's (2, 11, 1) routing over the physical topology.
  • Middle Node4
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 3, 14) to the Virtual Link's (2, 11, 1) routing over the physical topology.
  • Middle Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 4, 5) to the Virtual Link's (2, 11, 1) routing over the physical topology.
  • Middle Node7
    Link 15 : Node8→Node11 536.0 1
  • Appended the Physical Link: (8, 11, 2, 4) to the Virtual Link's (2, 11, 1) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node11
    235 Node4→Node12
    (4,12,1)
    23.906 16.094 Shortest path: [Node4, Node5, Node12]

    Shortest path: [4, 5, 12]
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 2, 11) to the Virtual Link's (4, 12, 1) routing over the physical topology.
  • Source Node4
    Link 13 : Node5→Node12 1036.0 1
  • Appended the Physical Link: (5, 12, 1, 7) to the Virtual Link's (4, 12, 1) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node12
    236 Node11→Node7
    (11,7,1)
    39.266 0.734 Shortest path: [Node11, Node8, Node7]

    Shortest path: [11, 8, 7]
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 2, 5) to the Virtual Link's (11, 7, 1) routing over the physical topology.
  • Source Node11
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 4, 6) to the Virtual Link's (11, 7, 1) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node7
    237 Node6→Node13
    (6,13,1)
    37.743 2.257 Shortest path: [Node6, Node7, Node8, Node13]

    Shortest path: [6, 7, 8, 13]
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 3, 15) to the Virtual Link's (6, 13, 1) routing over the physical topology.
  • Source Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 4, 7) to the Virtual Link's (6, 13, 1) routing over the physical topology.
  • Middle Node7
    Link 16 : Node8→Node13 668.0 1
  • Appended the Physical Link: (8, 13, 1, 12) to the Virtual Link's (6, 13, 1) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node13
    238 Node11→Node1
    (11,1,1)
    35.744 4.256 Shortest path: [Node11, Node8, Node7, Node1]

    Shortest path: [11, 8, 7, 1]
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 2, 6) to the Virtual Link's (11, 1, 1) routing over the physical topology.
  • Source Node11
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 4, 8) to the Virtual Link's (11, 1, 1) routing over the physical topology.
  • Middle Node8
    Link 4 : Node7→Node1 868.0 1
  • Appended the Physical Link: (7, 1, 0, 13) to the Virtual Link's (11, 1, 1) routing over the physical topology.
  • Middle Node7
    -- 0 no wavelength id Destination Node1
    239 Node6→Node3
    (6,3,1)
    22.947 17.053 Shortest path: [Node6, Node4, Node3]

    Shortest path: [6, 4, 3]
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 3, 9) to the Virtual Link's (6, 3, 1) routing over the physical topology.
  • Source Node6
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 2, 14) to the Virtual Link's (6, 3, 1) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node3
    240 Node11→Node5
    (11,5,1)
    38.322 1.678 Shortest path: [Node11, Node8, Node7, Node6, Node4, Node5]

    Shortest path: [11, 8, 7, 6, 4, 5]
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 2, 7) to the Virtual Link's (11, 5, 1) routing over the physical topology.
  • Source Node11
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 4, 9) to the Virtual Link's (11, 5, 1) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 4, 0) to the Virtual Link's (11, 5, 1) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 3, 10) to the Virtual Link's (11, 5, 1) routing over the physical topology.
  • Middle Node6
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 2, 12) to the Virtual Link's (11, 5, 1) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node5
    241 Node2→Node3
    (2,3,1)
    22.619 17.381 Shortest path: [Node2, Node0, Node3]

    Shortest path: [2, 0, 3]
    Link 1 : Node2→Node0 252.0 1
  • Appended the Physical Link: (2, 0, 0, 13) to the Virtual Link's (2, 3, 1) routing over the physical topology.
  • Source Node2
    Link 3 : Node0→Node3 324.0 1
  • Appended the Physical Link: (0, 3, 1, 15) to the Virtual Link's (2, 3, 1) routing over the physical topology.
  • Middle Node0
    -- 0 no wavelength id Destination Node3
    242 Node11→Node10
    (11,10,1)
    38.64 1.36 Shortest path: [Node11, Node10]

    Shortest path: [11, 10]
    Link 17 : Node11→Node10 408.0 1
  • Appended the Physical Link: (11, 10, 0, 15) to the Virtual Link's (11, 10, 1) routing over the physical topology.
  • Source Node11
    -- 0 no wavelength id Destination Node10
    243 Node13→Node4
    (13,4,1)
    39.782 0.218 Shortest path: [Node13, Node8, Node7, Node6, Node4]

    Shortest path: [13, 8, 7, 6, 4]
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 1, 13) to the Virtual Link's (13, 4, 1) routing over the physical topology.
  • Source Node13
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 4, 10) to the Virtual Link's (13, 4, 1) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 4, 1) to the Virtual Link's (13, 4, 1) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 3, 11) to the Virtual Link's (13, 4, 1) routing over the physical topology.
  • Middle Node6
    -- 0 no wavelength id Destination Node4
    244 Node1→Node12
    (1,12,1)
    36.128 3.872 Shortest path: [Node1, Node2, Node5, Node12]

    Shortest path: [1, 2, 5, 12]
    Link 2 : Node1→Node2 380.0 1
  • Appended the Physical Link: (1, 2, 0, 8) to the Virtual Link's (1, 12, 1) routing over the physical topology.
  • Source Node1
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 2, 9) to the Virtual Link's (1, 12, 1) routing over the physical topology.
  • Middle Node2
    Link 13 : Node5→Node12 1036.0 1
  • Appended the Physical Link: (5, 12, 1, 8) to the Virtual Link's (1, 12, 1) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node12
    245 Node11→Node3
    (11,3,1)
    37.721 2.279 Shortest path: [Node11, Node8, Node7, Node6, Node4, Node3]

    Shortest path: [11, 8, 7, 6, 4, 3]
    Link 15 : Node11→Node8 536.0 1
  • Appended the Physical Link: (11, 8, 2, 8) to the Virtual Link's (11, 3, 1) routing over the physical topology.
  • Source Node11
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 4, 11) to the Virtual Link's (11, 3, 1) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 4, 2) to the Virtual Link's (11, 3, 1) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 3, 12) to the Virtual Link's (11, 3, 1) routing over the physical topology.
  • Middle Node6
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 2, 15) to the Virtual Link's (11, 3, 1) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node3
    246 Node8→Node9
    (8,9,1)
    37.164 2.836 Shortest path: [Node8, Node9]

    Shortest path: [8, 9]
    Link 14 : Node8→Node9 752.0 1
  • Appended the Physical Link: (8, 9, 1, 3) to the Virtual Link's (8, 9, 1) routing over the physical topology.
  • Source Node8
    -- 0 no wavelength id Destination Node9
    247 Node1→Node2
    (1,2,1)
    39.306 0.694 Shortest path: [Node1, Node2]

    Shortest path: [1, 2]
    Link 2 : Node1→Node2 380.0 1
  • Appended the Physical Link: (1, 2, 0, 9) to the Virtual Link's (1, 2, 1) routing over the physical topology.
  • Source Node1
    -- 0 no wavelength id Destination Node2
    248 Node6→Node0
    (6,0,1)
    34.745 5.255 Shortest path: [Node6, Node4, Node3, Node0]

    Shortest path: [6, 4, 3, 0]
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 3, 13) to the Virtual Link's (6, 0, 1) routing over the physical topology.
  • Source Node6
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 3, 0) to the Virtual Link's (6, 0, 1) routing over the physical topology.
  • Middle Node4
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 2, 0) to the Virtual Link's (6, 0, 1) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node0
    249 Node13→Node2
    (13,2,1)
    36.235 3.765 Shortest path: [Node13, Node12, Node5, Node2]

    Shortest path: [13, 12, 5, 2]
    Link 20 : Node13→Node12 352.0 1
  • Appended the Physical Link: (13, 12, 1, 3) to the Virtual Link's (13, 2, 1) routing over the physical topology.
  • Source Node13
    Link 13 : Node12→Node5 1036.0 1
  • Appended the Physical Link: (12, 5, 1, 9) to the Virtual Link's (13, 2, 1) routing over the physical topology.
  • Middle Node12
    Link 5 : Node5→Node2 416.0 1
  • Appended the Physical Link: (5, 2, 2, 10) to the Virtual Link's (13, 2, 1) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node2
    250 Node8→Node13
    (8,13,1)
    37.507 2.493 Shortest path: [Node8, Node13]

    Shortest path: [8, 13]
    Link 16 : Node8→Node13 668.0 1
  • Appended the Physical Link: (8, 13, 1, 14) to the Virtual Link's (8, 13, 1) routing over the physical topology.
  • Source Node8
    -- 0 no wavelength id Destination Node13
    251 Node3→Node10
    (3,10,1)
    33.351 6.649 Shortest path: [Node3, Node10]

    Shortest path: [3, 10]
    Link 11 : Node3→Node10 1140.0 1
  • Appended the Physical Link: (3, 10, 0, 14) to the Virtual Link's (3, 10, 1) routing over the physical topology.
  • Source Node3
    -- 0 no wavelength id Destination Node10
    252 Node0→Node5
    (0,5,1)
    19.497 20.503 Shortest path: [Node0, Node2, Node5]

    Shortest path: [0, 2, 5]
    Link 1 : Node0→Node2 252.0 1
  • Appended the Physical Link: (0, 2, 0, 14) to the Virtual Link's (0, 5, 1) routing over the physical topology.
  • Source Node0
    Link 5 : Node2→Node5 416.0 1
  • Appended the Physical Link: (2, 5, 2, 11) to the Virtual Link's (0, 5, 1) routing over the physical topology.
  • Middle Node2
    -- 0 no wavelength id Destination Node5
    253 Node10→Node3
    (10,3,1)
    35.147 4.853 Shortest path: [Node10, Node3]

    Shortest path: [10, 3]
    Link 11 : Node10→Node3 1140.0 1
  • Appended the Physical Link: (10, 3, 0, 15) to the Virtual Link's (10, 3, 1) routing over the physical topology.
  • Source Node10
    -- 0 no wavelength id Destination Node3
    254 Node7→Node6
    (7,6,1)
    35.331 4.669 Shortest path: [Node7, Node6]

    Shortest path: [7, 6]
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 4, 3) to the Virtual Link's (7, 6, 1) routing over the physical topology.
  • Source Node7
    -- 0 no wavelength id Destination Node6
    255 Node10→Node5
    (10,5,1)
    37.635 2.365 Shortest path: [Node10, Node3, Node4, Node5]

    Shortest path: [10, 3, 4, 5]
    Link 11 : Node10→Node3 1140.0 1
  • Appended the Physical Link: (10, 3, 1, 0) to the Virtual Link's (10, 5, 1) routing over the physical topology.
  • Source Node10
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 3, 1) to the Virtual Link's (10, 5, 1) routing over the physical topology.
  • Middle Node3
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 2, 13) to the Virtual Link's (10, 5, 1) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node5
    256 Node6→Node12
    (6,12,1)
    17.36 22.64 Shortest path: [Node6, Node7, Node8, Node13, Node12]

    Shortest path: [6, 7, 8, 13, 12]
    Link 9 : Node6→Node7 212.0 1
  • Appended the Physical Link: (6, 7, 4, 4) to the Virtual Link's (6, 12, 1) routing over the physical topology.
  • Source Node6
    Link 10 : Node7→Node8 224.0 1
  • Appended the Physical Link: (7, 8, 4, 12) to the Virtual Link's (6, 12, 1) routing over the physical topology.
  • Middle Node7
    Link 16 : Node8→Node13 668.0 1
  • Appended the Physical Link: (8, 13, 1, 15) to the Virtual Link's (6, 12, 1) routing over the physical topology.
  • Middle Node8
    Link 20 : Node13→Node12 352.0 1
  • Appended the Physical Link: (13, 12, 1, 4) to the Virtual Link's (6, 12, 1) routing over the physical topology.
  • Middle Node13
    -- 0 no wavelength id Destination Node12
    257 Node3→Node2
    (3,2,1)
    39.793 0.207 Shortest path: [Node3, Node0, Node2]

    Shortest path: [3, 0, 2]
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 2, 1) to the Virtual Link's (3, 2, 1) routing over the physical topology.
  • Source Node3
    Link 1 : Node0→Node2 252.0 1
  • Appended the Physical Link: (0, 2, 0, 15) to the Virtual Link's (3, 2, 1) routing over the physical topology.
  • Middle Node0
    -- 0 no wavelength id Destination Node2
    258 Node13→Node12
    (13,12,1)
    15.236 24.764 Shortest path: [Node13, Node12]

    Shortest path: [13, 12]
    Link 20 : Node13→Node12 352.0 1
  • Appended the Physical Link: (13, 12, 1, 5) to the Virtual Link's (13, 12, 1) routing over the physical topology.
  • Source Node13
    -- 0 no wavelength id Destination Node12
    259 Node13→Node7
    (13,7,1)
    14.151 25.849 Shortest path: [Node13, Node8, Node7]

    Shortest path: [13, 8, 7]
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 2, 0) to the Virtual Link's (13, 7, 1) routing over the physical topology.
  • Source Node13
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 4, 13) to the Virtual Link's (13, 7, 1) routing over the physical topology.
  • Middle Node8
    -- 0 no wavelength id Destination Node7
    260 Node1→Node7
    (1,7,1)
    35.463 4.537 Shortest path: [Node1, Node7]

    Shortest path: [1, 7]
    Link 4 : Node1→Node7 868.0 1
  • Appended the Physical Link: (1, 7, 0, 14) to the Virtual Link's (1, 7, 1) routing over the physical topology.
  • Source Node1
    -- 0 no wavelength id Destination Node7
    261 Node8→Node5
    (8,5,1)
    24.753 15.247 Shortest path: [Node8, Node7, Node6, Node4, Node5]

    Shortest path: [8, 7, 6, 4, 5]
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 4, 14) to the Virtual Link's (8, 5, 1) routing over the physical topology.
  • Source Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 4, 5) to the Virtual Link's (8, 5, 1) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 3, 14) to the Virtual Link's (8, 5, 1) routing over the physical topology.
  • Middle Node6
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 2, 14) to the Virtual Link's (8, 5, 1) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node5
    262 Node3→Node9
    (3,9,1)
    37.119 2.881 Shortest path: [Node3, Node4, Node5, Node9]

    Shortest path: [3, 4, 5, 9]
    Link 6 : Node3→Node4 248.0 1
  • Appended the Physical Link: (3, 4, 3, 2) to the Virtual Link's (3, 9, 1) routing over the physical topology.
  • Source Node3
    Link 7 : Node4→Node5 272.0 1
  • Appended the Physical Link: (4, 5, 2, 15) to the Virtual Link's (3, 9, 1) routing over the physical topology.
  • Middle Node4
    Link 12 : Node5→Node9 704.0 1
  • Appended the Physical Link: (5, 9, 1, 4) to the Virtual Link's (3, 9, 1) routing over the physical topology.
  • Middle Node5
    -- 0 no wavelength id Destination Node9
    263 Node5→Node6
    (5,6,1)
    15.398 24.602 Shortest path: [Node5, Node4, Node6]

    Shortest path: [5, 4, 6]
    Link 7 : Node5→Node4 272.0 1
  • Appended the Physical Link: (5, 4, 3, 0) to the Virtual Link's (5, 6, 1) routing over the physical topology.
  • Source Node5
    Link 8 : Node4→Node6 292.0 1
  • Appended the Physical Link: (4, 6, 3, 15) to the Virtual Link's (5, 6, 1) routing over the physical topology.
  • Middle Node4
    -- 0 no wavelength id Destination Node6
    264 Node13→Node0
    (13,0,1)
    6.644 33.356 Shortest path: [Node13, Node8, Node7, Node6, Node4, Node3, Node0]

    Shortest path: [13, 8, 7, 6, 4, 3, 0]
    Link 16 : Node13→Node8 668.0 1
  • Appended the Physical Link: (13, 8, 2, 1) to the Virtual Link's (13, 0, 1) routing over the physical topology.
  • Source Node13
    Link 10 : Node8→Node7 224.0 1
  • Appended the Physical Link: (8, 7, 4, 15) to the Virtual Link's (13, 0, 1) routing over the physical topology.
  • Middle Node8
    Link 9 : Node7→Node6 212.0 1
  • Appended the Physical Link: (7, 6, 4, 6) to the Virtual Link's (13, 0, 1) routing over the physical topology.
  • Middle Node7
    Link 8 : Node6→Node4 292.0 1
  • Appended the Physical Link: (6, 4, 4, 0) to the Virtual Link's (13, 0, 1) routing over the physical topology.
  • Middle Node6
    Link 6 : Node4→Node3 248.0 1
  • Appended the Physical Link: (4, 3, 3, 3) to the Virtual Link's (13, 0, 1) routing over the physical topology.
  • Middle Node4
    Link 3 : Node3→Node0 324.0 1
  • Appended the Physical Link: (3, 0, 2, 2) to the Virtual Link's (13, 0, 1) routing over the physical topology.
  • Middle Node3
    -- 0 no wavelength id Destination Node0

    Routing of Virtual Links over the Physical Topology

    RoutingVirtualLinksOverPhysicalTopology.html


    Routing of Virtual Link over the Physical Topology (wavelengths)
    {(Virtal Link):[(WavelengthID 1, WavelengthID 2, ...)], ...}
    {(source, destination, number): [(source, destination, fiberID, wavelengthID), ...], ...}
    Virtual LinkWavelength ID
    sourcedestinationnumbersourcedestinationfiberIDwavelengthID
    13 10 0 13 10 0 0
    11 2 0 11 8 0 0
    8 7 0 0
    7 6 0 0
    6 4 0 0
    4 5 0 0
    5 2 0 0
    11 10 0 11 10 0 0
    8 9 0 8 9 0 0
    1 2 0 1 2 0 0
    1 6 0 1 7 0 0
    7 6 0 1
    3 1 0 3 0 0 0
    0 1 0 0
    13 1 0 13 8 0 0
    8 7 0 1
    7 1 0 1
    4 13 0 4 6 0 1
    6 7 0 2
    7 8 0 2
    8 13 0 1
    10 4 0 10 3 0 0
    3 4 0 0
    0 9 0 0 2 0 0
    2 5 0 1
    5 9 0 0
    3 9 0 3 4 0 1
    4 5 0 1
    5 9 0 1
    5 11 0 5 4 0 2
    4 6 0 2
    6 7 0 3
    7 8 0 3
    8 11 0 1
    3 8 0 3 4 0 2
    4 6 0 3
    6 7 0 4
    7 8 0 4
    3 10 0 3 10 0 1
    7 3 0 7 6 0 5
    6 4 0 4
    4 3 0 3
    12 8 0 12 13 0 0
    13 8 0 2
    8 7 0 8 7 0 5
    11 13 0 11 12 0 0
    12 13 0 1
    6 7 0 6 7 0 6
    5 1 0 5 2 0 2
    2 1 0 1
    6 9 0 6 7 0 7
    7 8 0 6
    8 9 0 1
    10 12 0 10 13 0 1
    13 12 0 2
    5 2 0 5 2 0 3
    2 7 0 2 5 0 4
    5 4 0 3
    4 6 0 5
    6 7 0 8
    10 9 0 10 11 0 1
    11 8 0 2
    8 9 0 2
    1 4 0 1 0 0 1
    0 3 0 1
    3 4 0 4
    11 4 0 11 8 0 3
    8 7 0 7
    7 6 0 9
    6 4 0 6
    13 12 0 13 12 0 3
    5 8 0 5 4 0 4
    4 6 0 7
    6 7 0 10
    7 8 0 8
    11 1 0 11 8 0 4
    8 7 0 9
    7 1 0 2
    11 7 0 11 8 0 5
    8 7 0 10
    9 4 0 9 5 0 2
    5 4 0 5
    7 1 0 7 1 0 3
    5 7 0 5 4 0 6
    4 6 0 8
    6 7 0 11
    6 10 0 6 7 0 12
    7 8 0 11
    8 11 0 6
    11 10 0 2
    3 5 0 3 4 0 5
    4 5 0 7
    2 4 0 2 5 0 5
    5 4 0 8
    4 11 0 4 6 0 9
    6 7 0 13
    7 8 0 12
    8 11 0 7
    7 9 0 7 8 0 13
    8 9 0 3
    0 1 0 0 1 0 2
    0 8 0 0 3 0 2
    3 4 0 6
    4 6 0 10
    6 7 0 14
    7 8 0 14
    13 3 0 13 8 0 3
    8 7 0 15
    7 6 0 15
    6 4 0 11
    4 3 0 7
    13 4 0 13 8 0 4
    8 7 1 0
    7 6 1 0
    6 4 0 12
    13 11 0 13 12 0 4
    12 11 0 1
    13 0 0 13 8 0 5
    8 7 1 1
    7 6 1 1
    6 4 0 13
    4 3 0 8
    3 0 0 3
    8 11 0 8 11 0 8
    4 3 0 4 3 0 9
    7 12 0 7 8 1 2
    8 13 0 6
    13 12 0 5
    12 9 0 12 5 0 0
    5 9 0 3
    8 2 0 8 7 1 3
    7 6 1 2
    6 4 0 14
    4 5 0 9
    5 2 0 6
    4 7 0 4 6 0 15
    6 7 1 3
    12 13 0 12 13 0 6
    1 7 0 1 7 0 4
    9 7 0 9 8 0 4
    8 7 1 4
    1 0 0 1 0 0 3
    8 12 0 8 13 0 7
    13 12 0 7
    13 5 0 13 12 0 8
    12 5 0 1
    11 6 0 11 8 0 9
    8 7 1 5
    7 6 1 4
    5 3 0 5 4 0 10
    4 3 0 10
    4 2 0 4 5 0 11
    5 2 0 7
    7 6 0 7 6 1 5
    10 0 0 10 3 0 2
    3 0 0 4
    2 12 0 2 5 0 8
    5 12 0 2
    4 9 0 4 5 0 12
    5 9 0 4
    13 9 0 13 8 0 8
    8 9 0 5
    2 6 0 2 5 0 9
    5 4 0 13
    4 6 1 0
    5 13 0 5 12 0 3
    12 13 0 9
    6 4 0 6 4 1 1
    13 2 0 13 12 0 10
    12 5 0 4
    5 2 0 10
    8 5 0 8 7 1 6
    7 6 1 6
    6 4 1 2
    4 5 0 14
    12 0 0 12 5 0 5
    5 2 0 11
    2 0 0 1
    0 7 0 0 3 0 5
    3 4 0 11
    4 6 1 3
    6 7 1 7
    13 8 0 13 8 0 9
    13 6 0 13 8 0 10
    8 7 1 7
    7 6 1 8
    10 8 0 10 11 0 3
    11 8 0 10
    10 2 0 10 3 0 3
    3 0 0 6
    0 2 0 2
    0 13 0 0 3 0 7
    3 4 0 12
    4 6 1 4
    6 7 1 9
    7 8 1 8
    8 13 0 11
    3 12 0 3 4 0 13
    4 5 0 15
    5 12 0 6
    4 6 0 4 6 1 5
    10 13 0 10 13 0 2
    6 13 0 6 7 1 10
    7 8 1 9
    8 13 0 12
    6 3 0 6 4 1 6
    4 3 0 14
    10 11 0 10 11 0 4
    2 3 0 2 0 0 3
    0 3 0 8
    12 10 0 12 13 0 11
    13 10 0 3
    11 12 0 11 12 0 2
    2 11 0 2 5 0 12
    5 4 1 0
    4 6 1 7
    6 7 1 11
    7 8 1 10
    8 11 0 11
    5 12 0 5 12 0 7
    4 10 0 4 3 0 15
    3 10 0 4
    11 5 0 11 8 0 12
    8 7 1 11
    7 6 1 12
    6 4 1 8
    4 5 1 1
    12 3 0 12 5 0 8
    5 4 1 2
    4 3 1 0
    6 8 0 6 7 1 13
    7 8 1 12
    8 4 0 8 7 1 13
    7 6 1 14
    6 4 1 9
    9 3 0 9 5 0 5
    5 4 1 3
    4 3 1 1
    3 13 0 3 4 1 2
    4 6 1 10
    6 7 1 15
    7 8 1 14
    8 13 0 13
    0 6 0 0 3 0 9
    3 4 1 3
    4 6 1 11
    7 2 0 7 6 2 0
    6 4 1 12
    4 5 1 4
    5 2 0 13
    2 13 0 2 5 0 14
    5 12 0 9
    12 13 0 12
    7 5 0 7 6 2 1
    6 4 1 13
    4 5 1 5
    0 10 0 0 3 0 10
    3 10 0 5
    5 10 0 5 4 1 6
    4 3 1 4
    3 10 0 6
    5 0 0 5 2 0 15
    2 0 0 4
    3 4 0 3 4 1 5
    9 10 0 9 8 0 6
    8 11 0 13
    11 10 0 5
    4 5 0 4 5 1 7
    1 11 0 1 7 0 5
    7 8 1 15
    8 11 0 14
    2 9 0 2 5 1 0
    5 9 0 6
    12 4 0 12 5 0 10
    5 4 1 8
    4 12 0 4 5 1 9
    5 12 0 11
    8 3 0 8 7 2 0
    7 6 2 2
    6 4 1 14
    4 3 1 6
    9 11 0 9 8 0 7
    8 11 0 15
    6 1 0 6 7 2 3
    7 1 0 6
    12 2 0 12 5 0 12
    5 2 1 1
    10 7 0 10 11 0 6
    11 8 1 0
    8 7 2 1
    2 1 0 2 1 0 2
    6 12 0 6 7 2 4
    7 8 2 2
    8 13 0 14
    13 12 0 13
    10 3 0 10 3 0 7
    0 4 0 0 3 0 11
    3 4 1 7
    9 5 0 9 5 0 7
    3 11 0 3 4 1 8
    4 6 1 15
    6 7 2 5
    7 8 2 3
    8 11 1 1
    3 0 0 3 0 0 12
    7 11 0 7 8 2 4
    8 11 1 2
    11 0 0 11 8 1 3
    8 7 2 5
    7 6 2 6
    6 4 2 0
    4 3 1 9
    3 0 0 13
    6 2 0 6 4 2 1
    4 5 1 10
    5 2 1 2
    12 1 0 12 5 0 13
    5 2 1 3
    2 1 0 3
    6 5 0 6 4 2 2
    4 5 1 11
    5 6 0 5 4 1 12
    4 6 2 3
    9 12 0 9 5 0 8
    5 12 0 14
    12 6 0 12 13 0 14
    13 8 0 15
    8 7 2 6
    7 6 2 7
    7 8 0 7 8 2 7
    10 6 0 10 11 0 7
    11 8 1 4
    8 7 2 8
    7 6 2 8
    8 1 0 8 7 2 9
    7 1 0 7
    9 0 0 9 5 0 9
    5 2 1 4
    2 0 0 5
    10 1 0 10 3 0 8
    3 0 0 14
    0 1 0 4
    7 10 0 7 8 2 10
    8 11 1 5
    11 10 0 8
    9 1 0 9 5 0 10
    5 2 1 5
    2 1 0 4
    5 9 0 5 9 0 11
    0 3 0 0 3 0 15
    9 8 0 9 8 0 8
    10 5 0 10 3 0 9
    3 4 1 10
    4 5 1 13
    11 9 0 11 8 1 6
    8 9 0 9
    0 2 0 0 2 0 6
    7 0 0 7 6 2 9
    6 4 2 4
    4 3 1 11
    3 0 1 0
    4 1 0 4 3 1 12
    3 0 1 1
    0 1 0 5
    6 0 0 6 4 2 5
    4 3 1 13
    3 0 1 2
    4 8 0 4 6 2 6
    6 7 2 10
    7 8 2 11
    12 7 0 12 13 0 15
    13 8 1 0
    8 7 2 12
    5 4 0 5 4 1 14
    0 11 0 0 3 1 3
    3 4 1 14
    4 6 2 7
    6 7 2 11
    7 8 2 13
    8 11 1 7
    0 12 0 0 2 0 7
    2 5 1 6
    5 12 0 15
    2 5 0 2 5 1 7
    3 2 0 3 0 1 4
    0 2 0 8
    7 13 0 7 8 2 14
    8 13 1 1
    1 13 0 1 7 0 8
    7 8 2 15
    8 13 1 2
    8 13 0 8 13 1 3
    1 12 0 1 2 0 5
    2 5 1 8
    5 12 1 0
    6 11 0 6 7 2 12
    7 8 3 0
    8 11 1 8
    2 10 0 2 0 0 9
    0 3 1 5
    3 10 0 10
    2 8 0 2 5 1 9
    5 4 1 15
    4 6 2 8
    6 7 2 13
    7 8 3 1
    9 2 0 9 5 0 12
    5 2 1 10
    8 6 0 8 7 3 2
    7 6 2 14
    12 11 0 12 11 0 3
    9 6 0 9 8 0 10
    8 7 3 3
    7 6 2 15
    0 5 0 0 2 0 10
    2 5 1 11
    11 3 0 11 8 1 9
    8 7 3 4
    7 6 3 0
    6 4 2 9
    4 3 1 15
    1 10 0 1 0 0 6
    0 3 1 6
    3 10 0 11
    4 0 0 4 3 2 0
    3 0 1 7
    2 0 0 2 0 0 11
    1 9 0 1 2 0 6
    2 5 1 12
    5 9 0 13
    3 7 0 3 4 2 1
    4 6 2 10
    6 7 3 1
    9 13 0 9 8 0 11
    8 13 1 4
    8 0 0 8 7 3 5
    7 6 3 2
    6 4 2 11
    4 3 2 2
    3 0 1 8
    13 7 0 13 8 1 5
    8 7 3 6
    8 10 0 8 11 1 10
    11 10 0 9
    1 5 0 1 2 0 7
    2 5 1 13
    12 5 0 12 5 1 1
    11 8 0 11 8 1 11
    1 8 0 1 7 0 9
    7 8 3 7
    7 4 0 7 6 3 3
    6 4 2 12
    3 6 0 3 4 2 3
    4 6 2 13
    1 3 0 1 0 0 7
    0 3 1 9
    0 12 1 0 2 0 12
    2 5 1 14
    5 12 1 2
    13 8 1 13 8 1 6
    13 9 1 13 8 1 7
    8 9 0 12
    8 4 1 8 7 3 8
    7 6 3 4
    6 4 2 14
    7 11 1 7 8 3 9
    8 11 1 12
    12 3 1 12 5 1 3
    5 4 2 0
    4 3 2 4
    10 4 1 10 3 0 12
    3 4 2 5
    8 6 1 8 7 3 10
    7 6 3 5
    10 8 1 10 11 0 10
    11 8 1 13
    2 12 1 2 5 1 15
    5 12 1 4
    8 11 1 8 11 1 14
    0 4 1 0 3 1 10
    3 4 2 6
    4 3 1 4 3 2 7
    5 3 1 5 4 2 1
    4 3 2 8
    3 13 1 3 4 2 9
    4 6 2 15
    6 7 3 6
    7 8 3 11
    8 13 1 8
    8 1 1 8 7 3 12
    7 1 0 10
    7 9 1 7 8 3 13
    8 9 0 13
    0 13 1 0 3 1 11
    3 4 2 10
    4 6 3 0
    6 7 3 7
    7 8 3 14
    8 13 1 9
    2 8 1 2 5 2 0
    5 4 2 2
    4 6 3 1
    6 7 3 8
    7 8 3 15
    7 10 1 7 8 4 0
    8 11 1 15
    11 10 0 11
    7 2 1 7 6 3 9
    6 4 3 2
    4 5 2 3
    5 2 2 1
    6 7 1 6 7 3 10
    9 2 1 9 5 0 14
    5 2 2 2
    4 8 1 4 6 3 3
    6 7 3 11
    7 8 4 1
    10 7 1 10 11 0 12
    11 8 2 0
    8 7 4 2
    13 10 1 13 10 0 4
    12 10 1 12 13 1 0
    13 10 0 5
    2 7 1 2 5 2 3
    5 4 2 4
    4 6 3 4
    6 7 3 12
    2 9 1 2 5 2 4
    5 9 0 15
    5 9 1 5 9 1 0
    12 8 1 12 13 1 1
    13 8 1 10
    10 1 1 10 3 0 13
    3 0 1 12
    0 1 0 8
    4 9 1 4 5 2 5
    5 9 1 1
    9 10 1 9 8 0 14
    8 11 2 1
    11 10 0 13
    10 9 1 10 11 0 14
    11 8 2 2
    8 9 0 15
    9 8 1 9 8 1 0
    5 4 1 5 4 2 6
    9 12 1 9 5 1 2
    5 12 1 5
    5 12 1 5 12 1 6
    9 7 1 9 8 1 1
    8 7 4 3
    5 2 1 5 2 2 5
    6 1 1 6 7 3 13
    7 1 0 11
    0 6 1 0 3 1 13
    3 4 2 11
    4 6 3 5
    11 9 1 11 8 2 3
    8 9 1 2
    2 6 1 2 5 2 6
    5 4 2 7
    4 6 3 6
    13 1 1 13 8 1 11
    8 7 4 4
    7 1 0 12
    13 11 1 13 12 1 2
    12 11 0 4
    11 12 1 11 12 0 5
    4 0 1 4 3 2 12
    3 0 1 14
    9 3 1 9 5 1 3
    5 4 2 8
    4 3 2 13
    6 2 1 6 4 3 7
    4 5 2 9
    5 2 2 7
    2 11 1 2 5 2 8
    5 4 2 10
    4 6 3 8
    6 7 3 14
    7 8 4 5
    8 11 2 4
    4 12 1 4 5 2 11
    5 12 1 7
    11 7 1 11 8 2 5
    8 7 4 6
    6 13 1 6 7 3 15
    7 8 4 7
    8 13 1 12
    11 1 1 11 8 2 6
    8 7 4 8
    7 1 0 13
    6 3 1 6 4 3 9
    4 3 2 14
    11 5 1 11 8 2 7
    8 7 4 9
    7 6 4 0
    6 4 3 10
    4 5 2 12
    2 3 1 2 0 0 13
    0 3 1 15
    11 10 1 11 10 0 15
    13 4 1 13 8 1 13
    8 7 4 10
    7 6 4 1
    6 4 3 11
    1 12 1 1 2 0 8
    2 5 2 9
    5 12 1 8
    11 3 1 11 8 2 8
    8 7 4 11
    7 6 4 2
    6 4 3 12
    4 3 2 15
    8 9 1 8 9 1 3
    1 2 1 1 2 0 9
    6 0 1 6 4 3 13
    4 3 3 0
    3 0 2 0
    13 2 1 13 12 1 3
    12 5 1 9
    5 2 2 10
    8 13 1 8 13 1 14
    3 10 1 3 10 0 14
    0 5 1 0 2 0 14
    2 5 2 11
    10 3 1 10 3 0 15
    7 6 1 7 6 4 3
    10 5 1 10 3 1 0
    3 4 3 1
    4 5 2 13
    6 12 1 6 7 4 4
    7 8 4 12
    8 13 1 15
    13 12 1 4
    3 2 1 3 0 2 1
    0 2 0 15
    13 12 1 13 12 1 5
    13 7 1 13 8 2 0
    8 7 4 13
    1 7 1 1 7 0 14
    8 5 1 8 7 4 14
    7 6 4 5
    6 4 3 14
    4 5 2 14
    3 9 1 3 4 3 2
    4 5 2 15
    5 9 1 4
    5 6 1 5 4 3 0
    4 6 3 15
    13 0 1 13 8 2 1
    8 7 4 15
    7 6 4 6
    6 4 4 0
    4 3 3 3
    3 0 2 2
    Statistics about Physical Links
    Physical LinkWavelengths wmn Fibers fmnDistance Lmn (km) Capacity requested (Gbps)Free capacity (Gbps) Reserved capacity for wavelengths (Gbps) Wavelegth Utilisation (%)
    Capacity requested / Capacity of the wavelengths
    Fiber Link Utilisation (%)
    Capacity requested / Capacity of the fibers
    Node0-Node1 9.0 1.0 260.0 323.413 36.587 360.0 89.8 50.5
    Node0-Node2 16.0 1.0 252.0 556.121 83.879 640.0 86.9 86.9
    Node1-Node2 10.0 1.0 380.0 373.858 26.142 400.0 93.5 58.4
    Node0-Node3 35.0 3.0 324.0 1212.259 187.741 1400.0 86.6 63.1
    Node1-Node7 15.0 1.0 868.0 546.992 53.008 600.0 91.2 85.5
    Node2-Node5 44.0 3.0 416.0 1536.028 223.972 1760.0 87.3 80.0
    Node3-Node4 52.0 4.0 248.0 1806.332 273.668 2080.0 86.8 70.6
    Node4-Node5 49.0 4.0 272.0 1686.326 273.674 1960.0 86.0 65.9
    Node4-Node6 65.0 5.0 292.0 2246.505 353.495 2600.0 86.4 70.2
    Node6-Node7 71.0 5.0 212.0 2475.115 364.885 2840.0 87.2 77.3
    Node7-Node8 80.0 5.0 224.0 2839.748 360.252 3200.0 88.7 88.7
    Node3-Node10 17.0 2.0 1140.0 601.533 78.467 680.0 88.5 47.0
    Node5-Node9 21.0 2.0 704.0 735.779 104.221 840.0 87.6 57.5
    Node5-Node12 26.0 2.0 1036.0 910.321 129.679 1040.0 87.5 71.1
    Node8-Node9 20.0 2.0 752.0 668.612 131.388 800.0 83.6 52.2
    Node8-Node11 41.0 3.0 536.0 1473.771 166.229 1640.0 89.9 76.8
    Node8-Node13 34.0 3.0 668.0 1171.806 188.194 1360.0 86.2 61.0
    Node10-Node11 16.0 1.0 408.0 558.064 81.936 640.0 87.2 87.2
    Node11-Node12 6.0 1.0 664.0 195.85 44.15 240.0 81.6 30.6
    Node10-Node13 6.0 1.0 684.0 209.962 30.038 240.0 87.5 32.8
    Node12-Node13 22.0 2.0 352.0 761.554 118.446 880.0 86.5 59.5
    Amn: Number of EDFAs that should be deployed on each fiber of physical link (m,n)
    Physical linknumber of EDFAs Amn
    Node0 → Node1 5.0
    Node0 → Node2 5.0
    Node1 → Node2 6.0
    Node0 → Node3 6.0
    Node1 → Node7 12.0
    Node2 → Node5 7.0
    Node3 → Node4 5.0
    Node4 → Node5 5.0
    Node4 → Node6 5.0
    Node6 → Node7 4.0
    Node7 → Node8 4.0
    Node3 → Node10 16.0
    Node5 → Node9 10.0
    Node5 → Node12 14.0
    Node8 → Node9 11.0
    Node8 → Node11 8.0
    Node8 → Node13 10.0
    Node10 → Node11 7.0
    Node11 → Node12 10.0
    Node10 → Node13 10.0
    Node12 → Node13 6.0
    Energy consumption evaluation in the IP layer
    NodePower consumption i N E r · ( Δ i + i N : i j C i j ) in Watts
    Node0 1000.0 * ( 13.0 + 18.0 ) = 31000.0
    Node1 1000.0 * ( 12.0 + 16.0 ) = 28000.0
    Node2 1000.0 * ( 14.0 + 20.0 ) = 34000.0
    Node3 1000.0 * ( 12.0 + 17.0 ) = 29000.0
    Node4 1000.0 * ( 13.0 + 18.0 ) = 31000.0
    Node5 1000.0 * ( 14.0 + 19.0 ) = 33000.0
    Node6 1000.0 * ( 14.0 + 20.0 ) = 34000.0
    Node7 1000.0 * ( 13.0 + 18.0 ) = 31000.0
    Node8 1000.0 * ( 14.0 + 20.0 ) = 34000.0
    Node9 1000.0 * ( 14.0 + 19.0 ) = 33000.0
    Node10 1000.0 * ( 15.0 + 20.0 ) = 35000.0
    Node11 1000.0 * ( 15.0 + 20.0 ) = 35000.0
    Node12 1000.0 * ( 13.0 + 16.0 ) = 29000.0
    Node13 1000.0 * ( 16.0 + 23.0 ) = 39000.0
    Total: 456000.0 Watts
    Energy consumption evaluation in the optical layer (Transponders)
    NodePower consumption m N n N m E t · w m n in Watts
    Node0 - Node1 73.0 * 9.0 = 657.0
    Node0 - Node2 73.0 * 16.0 = 1168.0
    Node1 - Node2 73.0 * 10.0 = 730.0
    Node0 - Node3 73.0 * 35.0 = 2555.0
    Node1 - Node7 73.0 * 15.0 = 1095.0
    Node2 - Node5 73.0 * 44.0 = 3212.0
    Node3 - Node4 73.0 * 52.0 = 3796.0
    Node4 - Node5 73.0 * 49.0 = 3577.0
    Node4 - Node6 73.0 * 65.0 = 4745.0
    Node6 - Node7 73.0 * 71.0 = 5183.0
    Node7 - Node8 73.0 * 80.0 = 5840.0
    Node3 - Node10 73.0 * 17.0 = 1241.0
    Node5 - Node9 73.0 * 21.0 = 1533.0
    Node5 - Node12 73.0 * 26.0 = 1898.0
    Node8 - Node9 73.0 * 20.0 = 1460.0
    Node8 - Node11 73.0 * 41.0 = 2993.0
    Node8 - Node13 73.0 * 34.0 = 2482.0
    Node10 - Node11 73.0 * 16.0 = 1168.0
    Node11 - Node12 73.0 * 6.0 = 438.0
    Node10 - Node13 73.0 * 6.0 = 438.0
    Node12 - Node13 73.0 * 22.0 = 1606.0
    Total: 47815.0 Watts
    Energy consumption evaluation in the optical layer (EDFAs)
    NodePower consumption m N n N m E e · A m n · f m n in Watts
    Node0 - Node1 8.0 * 5.0 * 1.0 = 40.0
    Node0 - Node2 8.0 * 5.0 * 1.0 = 40.0
    Node1 - Node2 8.0 * 6.0 * 1.0 = 48.0
    Node0 - Node3 8.0 * 6.0 * 3.0 = 144.0
    Node1 - Node7 8.0 * 12.0 * 1.0 = 96.0
    Node2 - Node5 8.0 * 7.0 * 3.0 = 168.0
    Node3 - Node4 8.0 * 5.0 * 4.0 = 160.0
    Node4 - Node5 8.0 * 5.0 * 4.0 = 160.0
    Node4 - Node6 8.0 * 5.0 * 5.0 = 200.0
    Node6 - Node7 8.0 * 4.0 * 5.0 = 160.0
    Node7 - Node8 8.0 * 4.0 * 5.0 = 160.0
    Node3 - Node10 8.0 * 16.0 * 2.0 = 256.0
    Node5 - Node9 8.0 * 10.0 * 2.0 = 160.0
    Node5 - Node12 8.0 * 14.0 * 2.0 = 224.0
    Node8 - Node9 8.0 * 11.0 * 2.0 = 176.0
    Node8 - Node11 8.0 * 8.0 * 3.0 = 192.0
    Node8 - Node13 8.0 * 10.0 * 3.0 = 240.0
    Node10 - Node11 8.0 * 7.0 * 1.0 = 56.0
    Node11 - Node12 8.0 * 10.0 * 1.0 = 80.0
    Node10 - Node13 8.0 * 10.0 * 1.0 = 80.0
    Node12 - Node13 8.0 * 6.0 * 2.0 = 96.0
    Total: 2936.0 Watts
    Evaluation of total energy consumption in the network
    i N E r · ( Δ i + i N : i j C i j ) + m N n N m E t · w m n + m N n N m E e · A m n · f m n
    Total power consumption 506.751 kWatts
    LatRouterPort: 30 µsec
    LatTransponder: 100 µsec
    LatEDFA: 0.1 µsec
    LatFiberKilometer: 5 µsec
    AlgorithmExperiment nameNetworkNumber of nodesNumber of linksX (Gbps)Total capacity processed (Gbps)Power of IP routers (kWatt)Power of WDM Transponders (kWatt)Power of EDFAs (kWatt)TotalPower (kWatt)Process Time (sec) Total lightpathsReused LightpathsPercent of Reused Lightpaths (%)Average Lightpaths ReusesAverage wavelengths utilisation (%)Average fiber links utilisation (%)
    HybridBypass2025-4-24_12-49-48_Times10DirMultiHybr_SnT-N6-N14-N24_X-0-1-2-3-4-5_Uni-PoiShen_Tucker_b_N14L211421407481.426456.047.8152.936506.751277.993 26419774.61.10287.565.4
    Measuring Latency per Traffic Request. Statistics for All Queues, All Types of routing traffic requests over the virtual topology
    Average Latency of traffic requestsMinimum Latency of a traffic requestMaximum Latency of a traffic request
    7389.849 1220.400 37630.900
    Measuring Latency per Traffic Request. Statistics for All Queues, routing of traffic requests over the virtual topology utilising new virtual links
    Average Latency of traffic requestsMinimum Latency of a traffic requestMaximum Latency of a traffic request
    5591.824 1220.400 10803.400
    Measuring Latency per Traffic Request. Statistics for All Queues, routing of traffic requests over the virtual topology utilising traffic grooming through existing virtual links
    Average Latency of traffic requestsMinimum Latency of a traffic requestMaximum Latency of a traffic request
    12136.635 1280.400 37630.900
    Measuring Latency per Traffic Request. Statistics for Queue 0, All Types of routing traffic requests over the virtual topology
    Average Latency of traffic requestsMinimum Latency of a traffic requestMaximum Latency of a traffic request
    5577.715 1220.400 10803.400
    Measuring Latency per Traffic Request. Statistics for Queue 0, routing of traffic requests over the virtual topology utilising new virtual links
    Average Latency of traffic requestsMinimum Latency of a traffic requestMaximum Latency of a traffic request
    5577.715 1220.400 10803.400
    Measuring Latency per Traffic Request. Statistics for Queue 0, routing of traffic requests over the virtual topology utilising traffic grooming through existing virtual links
    Average Latency of traffic requestsMinimum Latency of a traffic requestMaximum Latency of a traffic request
    Empty Empty Empty
    Measuring Latency per Traffic Request. Statistics for Queue 1, All Types of routing traffic requests over the virtual topology
    Average Latency of traffic requestsMinimum Latency of a traffic requestMaximum Latency of a traffic request
    9201.982 1220.400 37630.900
    Measuring Latency per Traffic Request. Statistics for Queue 1, routing of traffic requests over the virtual topology utilising new virtual links
    Average Latency of traffic requestsMinimum Latency of a traffic requestMaximum Latency of a traffic request
    5623.138 1220.400 10803.400
    Measuring Latency per Traffic Request. Statistics for Queue 1, routing of traffic requests over the virtual topology utilising traffic grooming through existing virtual links
    Average Latency of traffic requestsMinimum Latency of a traffic requestMaximum Latency of a traffic request
    12136.635 1280.400 37630.900